A formal model for a linear time correctness condition of proof nets of multiplicative linear logic

DOI10.1007/978-3-030-68446-4_16OpenAlexW3129864002MaRDI QIDQ2119124

Satoshi Matsuoka

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-68446-4_16

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Correctness of linear logic proof structures is NL-complete
• A linear algorithm for MLL proof net correctness and sequentialization
• Linear logic
• A linear-time algorithm for a special case of disjoint set union
• The structure of multiplicatives
• Direct encodings of NP-complete problems into Horn sequents of multiplicative linear logic
• An Efficient Unification Algorithm
• Fast verification of MLL proof nets via IMLL
• Semi-persistent Data Structures

This page was built for publication: A formal model for a linear time correctness condition of proof nets of multiplicative linear logic