scientific article; zbMATH DE number 1418450

zbMATH Open0951.03019MaRDI QIDQ4942005FDOQ4942005

Andrea Masini, Simone Martini, Stefano Guerrini

Publication date: 19 March 2000

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

functional programmingefficient reduction of lambda-termsmodal proof-theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) 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 (4)

• Title not available (Why is that?)
• Is the Optimal Implementation Inefficient? Elementarily Not
• Linear modalities in mininal logic
• Title not available (Why is that?)

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)