Proof nets and explicit substitutions
From MaRDI portal
Publication:4814187
DOI10.1017/S0960129502003791zbMath1047.03047MaRDI QIDQ4814187
Emmanuel Polonovski, Roberto Di Cosmo, Delia Kesner
Publication date: 7 September 2004
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
strong normalisation of \(\lambda\)-calculi with explicit substitutionstermination of cut elimination in proof nets
Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (11)
On explicit substitution with names ⋮ Resource operators for \(\lambda\)-calculus ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ The conservation theorem for differential nets ⋮ Node Replication: Theory And Practice ⋮ A prismoid framework for languages with resources ⋮ The spirit of node replication ⋮ Jumping Boxes ⋮ Confluence of Pure Differential Nets with Promotion ⋮ Strong normalization property for second order linear logic ⋮ Unnamed Item
This page was built for publication: Proof nets and explicit substitutions
