Proof nets and explicit substitutions

DOI10.1017/S0960129502003791MaRDI QIDQ4814187zbMATH OpenFDO

Authors Roberto Di Cosmo, Delia Kesner, Emmanuel Polonovski

Publication date 7 September 2004

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

strong normalisation of \(\lambda\)-calculi with explicit substitutionstermination of cut elimination in proof nets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1512610
• Term Rewriting and Applications
• Computer Science Logic
• A \(\lambda\)-calculus with explicit weakening and explicit substitution
• \(\lambda\)-calculi with explicit substitutions preserving strong normalization

Cited in

(17)

• Study of behaviours via visitable paths
• scientific article; zbMATH DE number 5910658 (Why is no real title available?)
• The conservation theorem for differential nets
• Confluence of Pure Differential Nets with Promotion
• The spirit of node replication
• scientific article; zbMATH DE number 1512610 (Why is no real title available?)
• Strong normalization property for second order linear logic
• scientific article; zbMATH DE number 7324256 (Why is no real title available?)
• Jumping Boxes
• Node Replication: Theory And Practice
• Proof nets and the call-by-value \(\lambda\)-calculus
• scientific article; zbMATH DE number 5875154 (Why is no real title available?)
• On explicit substitution with names
• Exponentials as substitutions and the cost of cut elimination in linear logic
• A prismoid framework for languages with resources
• Resource operators for \(\lambda\)-calculus
• Computer Science Logic

This page was built for publication: Proof nets and explicit substitutions

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