scientific article; zbMATH DE number 1512610

MaRDI QIDQ4508294zbMATH OpenFDO

Authors Roberto Di Cosmo, Delia Kesner, Emmanuel Polonovski

Publication date 3 October 2000

zbMATH Keywords

cut eliminationde Brujn indicesexplicit substitutionslambda calculuslinear logicproof netsstrong normalization

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Proof nets and explicit substitutions
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization
• Strong normalization of substitutions
• A -calculus with explicit weakening and explicit substitution
• Functional and Logic Programming

Cited in

(11)

• A -calculus with explicit weakening and explicit substitution
• Proving strong normalisation via non-deterministic translations into Klop's extended lambda-calculus
• scientific article; zbMATH DE number 5910658 (Why is no real title available?)
• Proof nets and explicit substitutions
• Computer Science Logic
• Functional and Logic Programming
• scientific article; zbMATH DE number 5875154 (Why is no real title available?)
• Term Rewriting and Applications
• scientific article; zbMATH DE number 7324256 (Why is no real title available?)
• Exponentials as substitutions and the cost of cut elimination in linear logic
• Resource operators for \(\lambda\)-calculus

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 Q4508294)