Theoretical PearlsEnumerators of lambda terms are reducing

DOI10.1017/S0956796800000356zbMath0816.03006MaRDI QIDQ4763984

Hendrik Pieter Barendregt

Publication date: 20 July 1995

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

zbMATH Keywords

reducing enumeratorclosed \(\lambda\)-term

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (2)

Enumerators of lambda terms are reducing constructively ⋮ The self-reduction in lambda calculus

Cites Work

• \(\lambda\)-definability and recursiveness

This page was built for publication: Theoretical PearlsEnumerators of lambda terms are reducing