Semi-axiomatic sequent calculus

DOI10.4230/LIPICS.FSCD.2020.29MaRDI QIDQ6854405zbMATH OpenFDO

Authors Henry DeYoung, Frank Pfenning, Klaas Pruiksma

Publication date 24 February 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2020.29

zbMATH Keywords

Curry-Howard isomorphismsequent calculusshared memory concurrency

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX) Theory of computing (68Qxx)

Cites work

• Adjoint logic with a 2-category of modes
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Combinatory logic. With two sections by William Craig.
• Focusing and polarization in linear, intuitionistic, and classical logics
• Functionality in combinatory logic.
• scientific article; zbMATH DE number 1078585 (Why is no real title available?)
• scientific article; zbMATH DE number 2079018 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Linear logic propositions as session types
• Linear logical relations and observational equivalences for session-based concurrency
• Logic Programming with Focusing Proofs in Linear Logic
• MULTILISP: a language for concurrent symbolic computation
• Propositions as sessions
• Relating state-based and process-based concurrency through linear logic (full-version)
• Scheme: A interpreter for extended lambda calculus
• Session types as intuitionistic linear propositions
• Structural cut elimination. I: Intuitionistic and classical logic
• The duality of computation

Cited in

(2)

• Dependent type refinements for futures
• Data layout from a type-theoretic perspective

This page was built for publication: Semi-axiomatic sequent calculus

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