Constructive proofs of the range property in lambda calculus

DOI10.1016/0304-3975(93)90083-6zbMath0796.03020OpenAlexW2009056279WikidataQ127646303 ScholiaQ127646303MaRDI QIDQ1314345

Hendrik Pieter Barendregt

Publication date: 26 September 1994

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

Full work available at URL: http://hdl.handle.net/2066/17244

zbMATH Keywords

constructive proofscoding of lambda-terms by natural numbersErshov numerationsrange of a combinatorrange property

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Is sized typing for Coq practical? ⋮ Lambda theories allowing terms with a finite number of fixed points ⋮ Towards the range property for the lambda theory \(\mathcal H\) ⋮ The range property fails for H ⋮ Some results on extensionality in lambda calculus ⋮ Unnamed Item ⋮ Existential Type Systems with No Types in Terms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus, its syntax and semantics
• The λ-calculus is ω-incomplete
• Theorie Der Numerierungen III
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Introduction to generalized type systems

This page was built for publication: Constructive proofs of the range property in lambda calculus