scientific article; zbMATH DE number 1418450

MaRDI QIDQ4942005zbMATH OpenFDO

Authors Simone Martini, Stefano Guerrini, Andrea Masini

Publication date 19 March 2000

zbMATH Keywords

efficient reduction of lambda-termsfunctional programmingmodal proof-theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 742718
• scientific article; zbMATH DE number 1231474
• scientific article; zbMATH DE number 1508934
• A proof-theoretic treatment of \(\lambda \)-reduction with cut-elimination: \(\lambda \)-calculus as a logic programming language
• δο!∈=1 Optimizing optimal λ-calculus implementations

Cited in

(4)

• Linear modalities in mininal logic
• scientific article; zbMATH DE number 742718 (Why is no real title available?)
• scientific article; zbMATH DE number 1508934 (Why is no real title available?)
• Is the Optimal Implementation Inefficient? Elementarily Not

This page was built for publication:

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