On global dynamics of optimal graph reduction

DOI10.1145/258948.258966MaRDI QIDQ5348875zbMATH OpenOpenAlexFDO

Authors Julia L. Lawall, Harry G. Mairson

Publication date 21 August 2017

Published in Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/258948.258966

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• On the dynamics of sharing graphs
• Optimal reductions in interaction systems
• scientific article; zbMATH DE number 1523048
• Optimality and inefficiency: what isn't a cost model of the lambda calculus?
• A general theory of sharing graphs

Cited in

(11)

• Parallel beta reduction is not elementary recursive
• (Optimal) duplication is not elementary recursive
• Optimality and inefficiency: what isn't a cost model of the lambda calculus?
• Bottom-up -reduction: uplinks and -DAGs
• Three Syntactic Theories for Combinatory Graph Reduction
• scientific article; zbMATH DE number 1086661 (Why is no real title available?)
• scientific article; zbMATH DE number 1523048 (Why is no real title available?)
• On the dynamics of sharing graphs
• Paths, computations and labels in the λ-calculus
• Programming Languages and Systems
• The weak lambda calculus as a reasonable machine

This page was built for publication: On global dynamics of optimal graph reduction

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