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 substitutions; termination of cut elimination in proof nets
03F05: Cut-elimination and normal-form theorems
03F52: Proof-theoretic aspects of linear logic and other substructural logics
03B40: Combinatory logic and lambda calculus
Related Items
Unnamed Item, The conservation theorem for differential nets, A prismoid framework for languages with resources, Resource operators for \(\lambda\)-calculus, Proof nets and the call-by-value \(\lambda\)-calculus, Strong normalization property for second order linear logic, The spirit of node replication, On explicit substitution with names, Jumping Boxes, Confluence of Pure Differential Nets with Promotion