PELCR: parallel environment for optimal lambda-calculus reduction

DOI10.1145/1243996.1243997MaRDI QIDQ5277779zbMATH OpenOpenAlexFDO

Authors Francesco Quaglia, Marco Pedicini

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

functional programminggeometry of interactionlinear logicoptimal reductionparallel implementationvirtual reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 2090647
• Parallel beta reduction is not elementary recursive
• Supporting function calls within PELCR
• Parallel reductions in \(\lambda\)-calculus
• scientific article; zbMATH DE number 4082955

Cited in

(10)

• Parallel beta reduction is not elementary recursive
• Supporting function calls within PELCR
• PELCR
• scientific article; zbMATH DE number 1086661 (Why is no real title available?)
• Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
• scientific article; zbMATH DE number 2090647 (Why is no real title available?)
• A simple parallel implementation of interaction nets in Haskell
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• Abstract machines, optimal reduction, and streams
• Light logics and optimal reduction: completeness and complexity

Describes a project that uses

Uses Software

• MPINE

This page was built for publication: PELCR: parallel environment for optimal lambda-calculus reduction

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