An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets

DOI10.4230/LIPICS.CSL.2018.15MaRDI QIDQ5079739FDOQ5079739

Authors: Jules Chouquet, Auclair Lionel Vaux 

Publication date: 28 May 2022

Recommendations

• scientific article; zbMATH DE number 7471682
• scientific article; zbMATH DE number 7003195
• Proof nets for unit-free multiplicative-additive linear logic
• Publication:4896506

zbMATH Keywords

linear logiccut eliminationproof netsdifferential linear logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Linear logic
• The relational model is injective for multiplicative exponential linear logic
• Uniformity and the Taylor expansion of ordinary lambda-terms
• The differential lambda-calculus
• Normal functors, power series and \(\lambda\)-calculus
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Finiteness spaces
• The structure of multiplicatives
• On Köthe sequence spaces and linear logic
• Strong normalizability as a finiteness structure via the Taylor expansion of \(\lambda\)-terms
• An introduction to differential linear logic: proof-nets, models and antiderivatives
• A new correctness criterion for MLL proof nets
• Computing connected proof(-structure)s from their Taylor expansion
• Weighted relational models of typed lambda-calculi
• Taylor expansion, \(\beta\)-reduction and normalization

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets

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