A global representation of the recursive functions in the \(\lambda\)- calculus

DOI10.1016/0304-3975(76)90025-6zbMath0375.02013OpenAlexW1978044249MaRDI QIDQ1245931

Hendrik Pieter Barendregt

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90025-6

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Unnamed Item ⋮ First-order reasoning and primitive recursive natural number notations ⋮ Expressive power of typed and type-free programming languages ⋮ Definition of the semantics of programming language constructs in terms of ?-calculus. I ⋮ Redexes are stable in the λ-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A set of postulates for the foundation of logic. II
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• \(\lambda\)-definability and recursiveness
• Combinatory logic and the ω-rule
• Computability and λ-definability

This page was built for publication: A global representation of the recursive functions in the \(\lambda\)- calculus