Computer Science Logic

DOI10.1007/11538363MaRDI QIDQ5394576zbMATH OpenOpenAlexFDO

Authors Pierre-Louis Curien, Claudia Faggian

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An approach to innocent strategies as graphs
• scientific article; zbMATH DE number 1231521
• scientific article; zbMATH DE number 937366
• Coherent models of proof nets
• scientific article; zbMATH DE number 1948179

Cited in

(10)

• Event domains, stable functions and proof-nets
• A graph abstract machine describing event structure composition
• Partial Orders, Event Structures and Linear Strategies
• An approach to innocent strategies as graphs
• Jump from parallel to sequential proofs: exponentials
• Conflict nets
• Study of behaviours via visitable paths
• The exponential logic of sequentialization
• Proof nets sequentialisation in multiplicative linear logic
• An exact correspondence between a typed pi-calculus and polarised proof-nets

This page was built for publication: Computer Science Logic

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