Token-passing optimal reduction with embedded read-back

MaRDI QIDQ5015378zbMATH OpenFDO

Authors Anton Salikhmetov

Publication date 7 December 2021

Full work available at URL https://arxiv.org/abs/1609.03644, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TERMGRAPH2016.7

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Recommendations

• YALE: yet another lambda evaluator based on interaction nets
• YALE: yet another lambda evaluator based on interaction nets
• Interaction systems II: The practice of optimal reductions
• Interaction Systems I: The theory of optimal reductions
• Weak reduction and garbage collection in interaction nets

Cites work

• Closed reduction: explicit substitutions without $\alpha$ -conversion
• scientific article; zbMATH DE number 2059570 (Why is no real title available?)
• Implementation and application of functional languages. 17th international workshop, IFL 2005, Dublin, Ireland, September 19--21, 2005. Revised selected papers.
• Optimality and inefficiency: what isn't a cost model of the lambda calculus?
• Principles and practice of declarative programming. International conference PPDP '99. Paris, France, September 29--October 1, 1999. Proceedings
• The optimal implementation of functional programming languages
• Token-passing nets for functional languages
• Token-passing nets: call-by-need for free
• Typed Lambda Calculi and Applications

Cited in

(3)

• Token-passing nets: call-by-need for free
• Token-passing nets for functional languages
• Optimal reductions in interaction systems

This page was built for publication: Token-passing optimal reduction with embedded read-back

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