Proof nets and the linear substitution calculus

DOI10.1007/978-3-030-02508-3_3OpenAlexW2885468325MaRDI QIDQ1623116FDOQ1623116

Authors: Beniamino Accattoli 

Publication date: 23 November 2018

Full work available at URL: https://arxiv.org/abs/1808.03395

Recommendations

• scientific article; zbMATH DE number 2134911
• Proof nets and the call-by-value \(\lambda\)-calculus
• scientific article; zbMATH DE number 7356671
• Coherence for sharing proof nets
• Term Rewriting and Applications

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (22)

• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• A strong bisimulation for a classical term calculus
• Tight typings and split bounds, fully developed
• Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
• Title not available (Why is that?)
• The spirit of node replication
• Title not available (Why is that?)
• Coherence for sharing proof nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fresh Look at the λ-Calculus
• Jumping Boxes
• Proof nets as formal Feynman diagrams
• Head linear reduction and pure proof net extraction
• Linear lambda calculus and deep inference
• Node Replication: Theory And Practice
• From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
• Title not available (Why is that?)
• Exponentials as substitutions and the cost of cut elimination in linear logic
• Coherence for sharing proof-nets
• Resource operators for \(\lambda\)-calculus
• Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

This page was built for publication: Proof nets and the linear substitution calculus

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