Proofs as processes
From MaRDI portal
Publication:1342245
DOI10.1016/0304-3975(94)00103-0zbMath0850.68297OpenAlexW2004063149WikidataQ57006884 ScholiaQ57006884MaRDI QIDQ1342245
Publication date: 17 July 1996
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00103-0
Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
On concurrent behaviors and focusing in linear logic, On the \(\pi\)-calculus and linear logic, A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types, Conflation Confers Concurrency, Strong normalisation in the \(\pi\)-calculus, A proof theoretical approach to communication, The true concurrency of differential interaction nets, Retracing some paths in process algebra, Separating Sessions Smoothly, Extracting total Amb programs from proofs, Unnamed Item, Unnamed Item, Variations on mobile processes, A specification structure for deadlock-freedom of synchronous processes, Observed Communication Semantics for Classical Processes, Relating State-Based and Process-Based Concurrency through Linear Logic, Relating reasoning methodologies in linear logic and process algebra, An exact correspondence between a typed pi-calculus and polarised proof-nets, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Relating state-based and process-based concurrency through linear logic (full-version), Phase semantics and Petri net interpretation for resource-sensitive strong negation, Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization, Reaction graph, Constructing weak simulations from linear implications for processes with private names, Full abstraction for PCF, Propositions as sessions, Prioritise the best variation
Cites Work
