Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
Proofs and types
A fully abstract semantics for a functional language with logic variables
Proceedings of the Fourth Annual Symposium on Logic in computer science
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process algebra
Concurrent constraint programming
Concurrent constraint programming
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
New foundations for the geometry of interaction
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Proof-nets and the Hilbert space
Proceedings of the workshop on Advances in linear logic
Geometry of interaction III: accommodating the additives
Proceedings of the workshop on Advances in linear logic
Handbook of logic in computer science (vol. 4)
Handbook of logic in computer science (vol. 3)
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Information and Computation
Domains and lambda-calculi
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Axioms for definability and full completeness
Proof, language, and interaction
Communication and Concurrency
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
Retracting Some Paths in Process Algebra
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Games Semantics for Full Propositional Linear Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Full Completeness of the Multiplicative Linear Logic of Chu Spaces
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
A deconstruction of non-deterministic classical cut elimination
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Event Domains, Stable Functions and Proof-Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
From Hilbert's program to a logic tool box
Annals of Mathematics and Artificial Intelligence
Actors and Logical Analysis of Interactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
From Focalization of Logic to the Logic of Focalization
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing in asynchronous games
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.