A construction of one-point bases in extended lambda calculi

DOI10.1016/J.IPL.2003.12.005zbMath1178.68136OpenAlexW2014251051WikidataQ56138477 ScholiaQ56138477MaRDI QIDQ1029098

Mayer Goldberg

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.12.005

zbMATH Keywords

constantsprogramming languagesbasesfunctional programmingprogramming calculilambda calculi

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gödelization in the lambda calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Revised report on the algorithmic language scheme
• An adequate and efficient left-associated binary numeral system in the λ-calculus
• A new proof for Craig's theorem

This page was built for publication: A construction of one-point bases in extended lambda calculi