Theoretical Pearls:Representing ‘undefined’ in lambda calculus

DOI10.1017/S0956796800000447zbMath0816.03007OpenAlexW1486611887MaRDI QIDQ4764617

Hendrik Pieter Barendregt

Publication date: 20 July 1995

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796800000447

zbMATH Keywords

\(\lambda\)-definability of partial recursive functions

Mathematics Subject Classification ID

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

Related Items

The interpretation of unsolvable λ-terms in models of untyped λ-calculus, A Proof Theoretic Interpretation of Model Theoretic Hiding, Graph easy sets of mute lambda terms, European Summer Meeting of the Association for Symbolic Logic, Enumerators of lambda terms are reducing constructively, A class of bounded functions, a database language and an extended lambda calculus, The expansion postponement in pure type systems, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, Checking algorithms for Pure Type Systems, Closure under alpha-conversion, Communicating contexts: A pragmatic approach to information exchange, An intuitionistic set-theoretical model of fully dependent CC, Using formal methods with SysML in aerospace design and engineering, On the number of types, Towards a formal framework for heterogeneous relation algebra, Fibrational modal type theory, GENERALIZATIONS OF THE RECURSION THEOREM, A simple model construction for the Calculus of Constructions, Introduction to Type Theory, Substitution contradiction, its resolution and the Church-Rosser theorem in TIL, Fixed point theorems for precomplete numberings, COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS, A compact kernel for the calculus of inductive constructions, The noneffectivity of Arslanov's completeness criterion and related theorems, Böhm Reduction in Infinitary Term Graph Rewriting Systems, Constructive proofs of the range property in lambda calculus, Some new results on easy lambda-terms

Cites Work

• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• \(\lambda\)-definability and recursiveness
• Classifying positive equivalence relations
• Theorie der Numerierungen I