scientific article; zbMATH DE number 2084341

MaRDI QIDQ3043823zbMATHFDO

Authors Torben Ægidius Mogensen

Publication date 6 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2244/22440205.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• An adequate and efficient left-associated binary numeral system in the \(\lambda\)-calculus
• Compaction of Church numerals
• Binary lambda calculus and combinatory logic
• Some results on numerical systems in \(\lambda\)-calculus
• Efficient self-interpretation in lambda calculus

Cited in

(9)

• Compaction of Church numerals
• Compact numeral representation with combinators
• An adequate and efficient left-associated binary numeral system in the \(\lambda\)-calculus
• An RNA-based theory of natural universal computation
• Arithmetic and Boolean operations on recursively run-length compressed natural numbers
• Representational efficiency
• Efficiency of lambda-encodings in total type theory
• Linear numeral systems
• Binary trees as a computational framework

This page was built for publication:

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