Bottom-up -reduction: uplinks and -DAGs

DOI10.3233/FI-2010-328MaRDI QIDQ3000285zbMATH OpenFDO

Authors Olin Shivers, Mitchell Wand

Publication date 18 May 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

suspension \(\lambda\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Programming Languages and Systems
• scientific article; zbMATH DE number 1231498
• Is the Optimal Implementation Inefficient? Elementarily Not
• \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
• On global dynamics of optimal graph reduction

Cited in

(4)

• The spirit of node replication
• Shrinking Reductions in SML.NET
• Node Replication: Theory And Practice
• Programming Languages and Systems

This page was built for publication: Bottom-up \(\beta\)-reduction: uplinks and \(\lambda\)-DAGs

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