The optimal implementation of functional programming languages

zbMATH Open1282.68005MaRDI QIDQ5397484FDOQ5397484

Authors: Andrea Asperti, Stefano Guerrini 

Publication date: 21 February 2014

Recommendations

• scientific article; zbMATH DE number 194911
• Weak optimality, and the meaning of sharing
• scientific article; zbMATH DE number 3976299
• Interaction systems II: The practice of optimal reductions
• scientific article; zbMATH DE number 1547155

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Functional programming and lambda calculus (68N18)

Cited In (38)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lambda-calculus with director strings
• On randomised strategies in the \(\lambda \)-calculus
• The evaluation of first-order substitution is monadic second-order compatible
• Interaction nets for linear logic
• Proof nets, garbage, and computations
• Reducibility between classes of port graph grammar.
• Relating conflict-free stable transition and event models via redex families
• The weak lambda calculus as a reasonable machine
• Title not available (Why is that?)
• Linear dependent types in a call-by-value scenario
• The graphical Krivine machine
• New developments in environment machines
• Phase semantics and decidability of elementary affine logic
• Title not available (Why is that?)
• Jumping Boxes
• Distributed computation by graph reduction
• Optimizing structural recursion in functional programs
• Light logics and optimal reduction: completeness and complexity
• Is the Optimal Implementation Inefficient? Elementarily Not
• Interaction nets with McCarthy's \(\mathsf{amb}\)
• Abstract machines, optimal reduction, and streams
• Preface to the special volume
• A prismoid framework for languages with resources
• Token-passing nets for functional languages
• Complete laziness: a natural semantics
• Non-linearity as the metric completion of linearity
• Title not available (Why is that?)
• Resource operators for \(\lambda\)-calculus
• Parallel beta reduction is not elementary recursive
• (Optimal) duplication is not elementary recursive
• A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spinal atomic \(\lambda\)-calculus
• Title not available (Why is that?)

This page was built for publication: The optimal implementation of functional programming languages

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