Substructural Proofs as Automata

DOI10.1007/978-3-319-47958-3_1zbMath1485.03251OpenAlexW2529550398MaRDI QIDQ3179272

Henry DeYoung, Frank Pfenning

Publication date: 21 December 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-47958-3_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Sur une variante des fonctions séquentielles
• Subtyping for session types in the pi calculus
• Multiparty Session Types Meet Communicating Automata
• Session Types as Intuitionistic Linear Propositions
• Functionality in Combinatory Logic
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Least and Greatest Fixed Points in Linear Logic

This page was built for publication: Substructural Proofs as Automata