scholarly journals Quantum Lambda Calculus

Author(s):  
Peter Selinger ◽  
Benoît Valiron
Keyword(s):  
Author(s):  
Henk Barendregt ◽  
Wil Dekkers ◽  
Richard Statman
Keyword(s):  

1979 ◽  
Vol 28 (3) ◽  
pp. 269-282 ◽  
Author(s):  
John Staples

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.


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

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

Axiomathes ◽  
2021 ◽  
Author(s):  
Andrew Powell

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.


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

2016 ◽  
Vol 50 (12) ◽  
pp. 177-188
Author(s):  
Jeff Polakow
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document