Abstract machines, optimal reduction, and streams

DOI10.1017/S096012951900001XzbMath1434.68089OpenAlexW2937263200MaRDI QIDQ5108536

Anna Chiara Lai, Mario Piazza, Marco Pedicini

Publication date: 4 May 2020

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012951900001x

zbMATH Keywords

linear logicparallel implementationfunctional programmingCurry-Howard isomorphismgeometry of interactionstreams

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Uses Software

• PELCR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bridging model for multi-core computing
• An abstract framework for environment machines
• Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations
• A tutorial on coinductive stream calculus and signal flow graphs
• Distilling abstract machines
• Typing a Core Binary-Field Arithmetic in a Light Logic
• Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?
• The bologna optimal higher-order machine
• Parallelism and Synchronization in an Infinitary Context
• Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach
• A coinductive calculus of streams
• The Functional Approach to Programming
• PELCR
• The Mechanical Evaluation of Expressions

This page was built for publication: Abstract machines, optimal reduction, and streams