Theoretical Pearls

DOI10.1017/S0956796800000149zbMATH Open0941.03513OpenAlexW165194345MaRDI QIDQ4939701FDOQ4939701

Erik Barendsen

Publication date: 9 February 2000

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

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

zbMATH Keywords

untyped \(\lambda\)-calculusunsolvable \(\lambda\)-terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited In (3)

• Polymorphic extensions of simple type structures. With an application to a bar recursive minimization
• Some results on numerical systems in \(\lambda\)-calculus
• Recursion-free modular arithmetic in the lambda-calculus

This page was built for publication: Theoretical Pearls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939701)