Optimizing optimal reduction

DOI10.1145/1131313.1131315zbMath1367.03028OpenAlexW2123808861MaRDI QIDQ5277747

Paolo Coppola, Simone Martini

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/1131313.1131315

zbMATH Keywords

linear logicoptimal reductionLamping algorithm

Mathematics Subject Classification ID

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

Related Items (5)

Light logics and optimal reduction: completeness and complexity ⋮ An Elementary Affine λ-Calculus with Multithreading and Side Effects ⋮ Light types for polynomial time computation in lambda calculus ⋮ Linear logic by levels and bounded time complexity ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: Optimizing optimal reduction