Encoding Strategies in the Lambda Calculus with Interaction Nets

2006 ◽  
pp. 19-36 ◽  
Author(s):  
Ian Mackie
Keyword(s):  
Lambda Calculus ◽  
Encoding Strategies

Lambda Calculus with Types

2009 ◽  
Author(s):  
Henk Barendregt ◽  
Wil Dekkers ◽  
Richard Statman
Keyword(s):  
Lambda Calculus

Age-related memory deficit: Role of study time and encoding strategies

2010 ◽  
Author(s):  
Charlotte Froger ◽  
Badiaa Bouazzaoui ◽  
Laurence Taconnat
Keyword(s):  
Memory Deficit ◽  
Study Time ◽  
Age Related ◽  
Encoding Strategies

A lambda calculus with naive substitution

1979 ◽  
Vol 28 (3) ◽  
pp. 269-282 ◽  
Author(s):  
John Staples
Keyword(s):  
Lambda Calculus ◽  
Classical Case ◽  
Syntactic Theory ◽  
Alternative Approach ◽  
New Formulation

AbstractAn alternative approach is proposed to the basic definitions of the lassical lambda calculus. A proof is sketched of the equivalence of the approach with the classical case. The new formulation simplifies some aspects of the syntactic theory of the lambda calculus. In particular it provides a justification for omitting in syntactic theory discussion of changes of bound variable.

scholarly journals Backpropagation in the simply typed lambda-calculus with linear negation

2020 ◽  
Vol 4 (POPL) ◽  
pp. 1-27 ◽  
Author(s):  
Aloïs Brunel ◽  
Damiano Mazza ◽  
Michele Pagani
Keyword(s):  
Lambda Calculus ◽  
Typed Lambda Calculus

scholarly journals Algebras and coalgebras in the light affine Lambda calculus

2015 ◽  
Vol 50 (9) ◽  
pp. 114-126 ◽  
Author(s):  
Marco Gaboardi ◽  
Romain Péchoux
Keyword(s):  
Lambda Calculus

scholarly journals The Limits of Computation

Axiomathes ◽  
2021 ◽  
Author(s):  
Andrew Powell
Keyword(s):  
Natural Number ◽  
Set Theory ◽  
Lambda Calculus ◽  
Second Order ◽  
Functional Interpretation ◽  
Arbitrary Type ◽  
Computable Functions

AbstractThis article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy of ordinal recursive functionals of arbitrary type that can be reduced by substitution to natural number functions.

scholarly journals Maximal sharing in the Lambda calculus with letrec

2014 ◽  
Vol 49 (9) ◽  
pp. 67-80 ◽  
Author(s):  
Clemens Grabmayer ◽  
Jan Rochel
Keyword(s):  
Lambda Calculus

Embedding a full linear Lambda calculus in Haskell

2016 ◽  
Vol 50 (12) ◽  
pp. 177-188
Author(s):  
Jeff Polakow
Keyword(s):  
Lambda Calculus
Sign in / Sign up

Export Citation Format

Share Document