PELCR: parallel environment for optimal lambda-calculus reduction

DOI10.1145/1243996.1243997zbMATH Open1367.68053OpenAlexW1983303046MaRDI QIDQ5277779FDOQ5277779

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

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

zbMATH Keywords

functional programminglinear logicgeometry of interactionparallel implementationoptimal reductionvirtual 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)

Cited In (9)

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

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)