The self-reduction in lambda calculus

DOI10.1016/S0304-3975(99)00190-5zbMATH Open0938.68024MaRDI QIDQ1978706FDOQ1978706

Yanyan Li

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Efficient self-interpretation in lambda calculus
• scientific article; zbMATH DE number 845591
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus

zbMATH Keywords

Lambda calculusself-reduction

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Efficient self-interpretation in lambda calculus
• Introduction to generalized type systems
• Title not available (Why is that?)
• Theoretical PearlsEnumerators of lambda terms are reducing

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Programs as data structures in \(\lambda\)SF-calculus
• Self-quotation in a typed, intensional lambda-calculus
• Theoretical PearlsEnumerators of lambda terms are reducing
• Refining reduction in the lambda calculus
• Reducibility Proofs in the λ-Calculus
• Title not available (Why is that?)
• Needed reduction and spine strategies for the lambda calculus

This page was built for publication: The self-reduction in lambda calculus

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