Substructural proofs as automata

DOI10.1007/978-3-319-47958-3_1MaRDI QIDQ3179272zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Substructural logic of proofs
• Synthesized substructural logics
• scientific article; zbMATH DE number 6680140
• Relational proof system for linear and other substructural logics
• Linear logic

Cites work

• Cut reduction in linear logic as asynchronous session-typed communication
• Functionality in Combinatory Logic
• scientific article; zbMATH DE number 6680140 (Why is no real title available?)
• scientific article; zbMATH DE number 1078585 (Why is no real title available?)
• Infinitary proof theory: the multiplicative additive case
• Linear logic
• Multiparty session types meet communicating automata
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Session types as intuitionistic linear propositions
• Subtyping for session types in the pi calculus
• Sur une variante des fonctions séquentielles

Cited in

(2)

• Circular proofs as session-typed processes: a local validity condition
• Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic

This page was built for publication: Substructural proofs as automata

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