Paths, computations and labels in the -calculus

DOI10.1016/0304-3975(94)00279-7MaRDI QIDQ673626zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Cosimo Laneve

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00279-7

zbMATH Keywords

\(\lambda\)-calculuslabelingoptimal graph reductionpaths in the initial term of derivationredex-families

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Paths, computations and labels in the λ-calculus
• Publication:4490737
• scientific article; zbMATH DE number 1523048
• Redexes are stable in the -calculus
• Higher-order families

Cites work

• Optimal reductions in interaction systems

Cited in

(12)

• Parallel beta reduction is not elementary recursive
• Weak linearization of the lambda calculus
• A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine
• On the dynamics of sharing graphs
• Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
• Geometry of resource interaction -- \textit{a minimalist approach}
• Paths, computations and labels in the λ-calculus
• Higher-order families
• Redexes are stable in the -calculus
• Infinitary combinatory reduction systems
• Quantitative weak linearisation
• (Definitely not) boring interaction abstract machines

This page was built for publication: Paths, computations and labels in the \(\lambda\)-calculus

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