Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
A semantics for ML concurrency primitives
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order concurrency
A calculus of mobile processes, II
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Definition of Standard ML
The π-Calculus in Direct Style
Higher-Order and Symbolic Computation
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Towards a Theory of Bisimulation for Local Names
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A theory of weak bisimulation for Core CML
Journal of Functional Programming
Information and Computation
On Barbed Equivalences in pi-Calculus
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
Contextual Labelled Semantics for Higher-order Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |