scientific article; zbMATH DE number 515729

MaRDI QIDQ4283231zbMATH OpenFDO

Authors Alessandro Berarducci, Corrado Böhm

Publication date 9 October 1994

zbMATH Keywords

functions with recursive callslambda calculusrecursive equationsterm rewriting

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Efficient self-interpretation in lambda calculus
• scientific article; zbMATH DE number 1522992
• scientific article; zbMATH DE number 1339950
• The self-reduction in lambda calculus
• Breaking through the normalization barrier: a self-interpreter for F-omega

Cited in

(12)

• An algebraic view of the Böhm-out technique
• Combinatory reduction systems: Introduction and survey
• Programs as data structures in \(\lambda\)SF-calculus
• Incorporating quotation and evaluation into Church's type theory
• The self-reduction in lambda calculus
• Self-quotation in a typed, intensional lambda-calculus
• Breaking through the normalization barrier: a self-interpreter for F-omega
• Gödelization in the lambda calculus
• Encoding the factorisation calculus
• More problems in rewriting
• Gems of Corrado Böhm
• Lambda-definable term rewriting systems

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 Q4283231)