Process Realizability

2015/12/19 by Abramsky, Samson
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1512.06233

Abstract

We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.

Related

• Linearizability: a correctness condition for concurrent objects
• Linear Logic, the π-calculus, and their Metatheory: A Recipe for Proofs as Processes
• Quantitative classical realizability
• A Generic Logic for Proving Linearizability (Extended Version)
• Functions as proofs as processes