Intuitionistic differential nets and lambda-calculus

DOI10.1016/J.TCS.2010.12.022zbMath1223.03049OpenAlexW2109323214MaRDI QIDQ534707

Paolo Tranquilli

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.022

zbMATH Keywords

linear logicnormalizationconfluenceproof netslambda-calculusdifferential interaction netsexponential reduction

Mathematics Subject Classification ID

Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (11)

Relational graph models, Taylor expansion and extensionality ⋮ Transport of finiteness structures and applications ⋮ Visible acyclic differential nets. I: Semantics ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ The conservation theorem for differential nets ⋮ Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach ⋮ Realizability Proof for Normalization of Full Differential Linear Logic ⋮ Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion ⋮ Unnamed Item ⋮ Confluence of Pure Differential Nets with Promotion ⋮ Strong normalization property for second order linear logic

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Differential interaction nets
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Strong normalization property for second order linear logic
• The structure of multiplicatives
• An equivalence between lambda- terms
• Polarized proof-nets and \(\lambda \mu\)-calculus
• The differential lambda-calculus
• The differential \(\lambda \mu\)-calculus
• A linearization of the Lambda-calculus and consequences
• A semantics for lambda calculi with resources
• On Köthe sequence spaces and linear logic
• On Linear Combinations of λ-Terms
• Finiteness spaces

This page was built for publication: Intuitionistic differential nets and lambda-calculus