The optimal implementation of functional programming languages
From MaRDI portal
Publication:5397484
Recommendations
Cited in
(40)- Interaction nets for linear logic
- Proof nets, garbage, and computations
- The evaluation of first-order substitution is monadic second-order compatible
- Relating conflict-free stable transition and event models via redex families
- Lambda-calculus with director strings
- Parallel beta reduction is not elementary recursive
- Reducibility between classes of port graph grammar.
- (Optimal) duplication is not elementary recursive
- On randomised strategies in the -calculus
- Spinal atomic \(\lambda\)-calculus
- Linear dependent types in a call-by-value scenario
- The graphical Krivine machine
- scientific article; zbMATH DE number 1728386 (Why is no real title available?)
- Interaction nets with McCarthy's \(\mathsf{amb}\)
- A fully labelled lambda calculus: towards closed reduction in the geometry of interaction machine
- Complete laziness: a natural semantics
- Token-passing nets for functional languages
- Optimizing structural recursion in functional programs
- Jumping Boxes
- Distributed computation by graph reduction
- scientific article; zbMATH DE number 3974250 (Why is no real title available?)
- scientific article; zbMATH DE number 3976299 (Why is no real title available?)
- The bologna optimal higher-order machine
- scientific article; zbMATH DE number 1161584 (Why is no real title available?)
- scientific article; zbMATH DE number 194911 (Why is no real title available?)
- Token-passing optimal reduction with embedded read-back
- Abstract machines, optimal reduction, and streams
- scientific article; zbMATH DE number 7204428 (Why is no real title available?)
- Is the Optimal Implementation Inefficient? Elementarily Not
- A categorical reduction system for linear logic
- New developments in environment machines
- Non-linearity as the metric completion of linearity
- Preface to the special volume
- Phase semantics and decidability of elementary affine logic
- scientific article; zbMATH DE number 7809760 (Why is no real title available?)
- Light logics and optimal reduction: completeness and complexity
- A prismoid framework for languages with resources
- Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
- Resource operators for \(\lambda\)-calculus
- The weak lambda calculus as a reasonable machine
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)
