Enumerators of lambda terms are reducing constructively

DOI10.1016/0168-0072(94)00022-UzbMath0819.03004OpenAlexW2139830960MaRDI QIDQ1891248

Hendrik Pieter Barendregt

Publication date: 27 August 1995

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00022-u

zbMATH Keywords

lambda calculusintuitionistic version of Statman's proofreducing enumerator

Mathematics Subject Classification ID

Intuitionistic mathematics (03F55) Combinatory logic and lambda calculus (03B40)

Related Items

The Impact of the Lambda Calculus in Logic and Computer Science, Unnamed Item

Cites Work

• Unnamed Item
• The lambda calculus, its syntax and semantics
• Theoretical PearlsEnumerators of lambda terms are reducing
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus