Safe operators: Brackets closed forever. Optimizing optimal -calculus implementations

DOI10.1007/S002000050083MaRDI QIDQ1392661zbMATH OpenOpenAlexFDO

Authors Andrea Asperti, Juliusz Chroboczek

Publication date 26 November 1998

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050083

zbMATH Keywords

functional programminglambda calculussharingrewriting rulesoptimal reductions

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• The Safe Lambda Calculus
• The Safe Lambda Calculus
• δο!∈=1 Optimizing optimal λ-calculus implementations
• Safe recursion revisited. I: Categorical semantics for lower complexity
• Safe recursion with higher types and BCK-algebra
• scientific article; zbMATH DE number 1223626
• Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
• Publication:4945227
• On an interpretation of safe recursion in light affine logic

Cited in

(3)

• Abstract machines, optimal reduction, and streams
• δο!∈=1 Optimizing optimal λ-calculus implementations
• scientific article; zbMATH DE number 742718 (Why is no real title available?)

This page was built for publication: Safe operators: Brackets closed forever. Optimizing optimal \(\lambda\)-calculus implementations

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