The lambda-gamma calculus: A language adequate for defining recursive functions
From MaRDI portal
Publication:2542069
DOI10.1016/0020-0255(77)90016-0zbMath0205.01402OpenAlexW1965524812MaRDI QIDQ2542069
Publication date: 1970
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(77)90016-0
Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)
Uses Software
Cites Work
- Combinatory logic. With two sections by William Craig.
- A set of postulates for the foundation of logic
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Correspondence between ALGOL 60 and Church's Lambda-notation
- Computability of Recursive Functions
- The Mechanical Evaluation of Expressions
- Unnamed Item
- Unnamed Item
This page was built for publication: The lambda-gamma calculus: A language adequate for defining recursive functions