A construction of one-point bases in extended lambda calculi

DOI10.1016/J.IPL.2003.12.005MaRDI QIDQ1029098zbMATH OpenOpenAlexWikidataFDO

Authors 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

basesconstantsfunctional programminglambda calculiprogramming calculiprogramming languages

Mathematics Subject Classification ID

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

Recommendations

• The systematic construction of a one-combinator basis for lambda-terms
• Some results on extensionality in lambda calculus
• scientific article; zbMATH DE number 176159
• Infinitary lambda calculi from a linear perspective
• Fundamental theorems of extensional untyped -calculus revisited
• Theorem Proving in Higher Order Logics
• Extended Lambek calculi and first-order linear logic
• On modular properties of higher order extensional lambda calculi
• scientific article; zbMATH DE number 4047682

Cites work

• A new proof for Craig's theorem
• An adequate and efficient left-associated binary numeral system in the -calculus
• Gödelization in the lambda calculus
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• scientific article; zbMATH DE number 3423994 (Why is no real title available?)
• Revised report on the algorithmic language scheme
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(1)

• The systematic construction of a one-combinator basis for lambda-terms

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

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