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 QIDQ5079739zbMATH OpenFDO

Authors Jules Chouquet, Auclair Lionel Vaux

Publication date 28 May 2022

zbMATH Keywords

linear logiccut eliminationproof netsdifferential linear logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

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

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 7089070 (Why is no real title available?)
• scientific article; zbMATH DE number 7566060 (Why is no real title available?)
• scientific article; zbMATH DE number 7471682 (Why is no real title available?)

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)