The conservation theorem for differential nets

DOI10.1017/S0960129515000456zbMath1456.03103MaRDI QIDQ5360213

Michele Pagani, Paolo Tranquilli

Publication date: 28 September 2017

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

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

An introduction to differential linear logic: proof-nets, models and antiderivatives, Visible acyclic differential nets. I: Semantics, Factorization in call-by-name and call-by-value calculi via linear logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intuitionistic differential nets and lambda-calculus
• Linear logic
• Differential interaction nets
• Strong normalization property for second order linear logic
• The lambda calculus, its syntax and semantics
• The structure of multiplicatives
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Additives of linear logic and normalization. I: A (restricted) Church-Rosser property.
• The differential lambda-calculus
• Realizability Proof for Normalization of Full Differential Linear Logic
• Interpreting a Finitary Pi-calculus in Differential Interaction Nets
• Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
• The Cut-Elimination Theorem for Differential Nets with Promotion
• Confluence of Pure Differential Nets with Promotion
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Proof nets and explicit substitutions
• Intensional interpretations of functionals of finite type I
• Finiteness spaces
• An Explicit Framework for Interaction Nets