Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Notions of computation and monads
Information and Computation
An algebra for process creation
Acta Informatica
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
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, I
Information and Computation
A theory of higher order communicating systems
Information and Computation
Communication and Concurrency
Towards a Semantic Theory of CML (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A Semantic Theory for Concurrent ML
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
FACILE: A Symmetric Integration of Concurrent and Functional Programming
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Logical Specification of Operational Semantics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic 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
Theoretical Computer Science - Applied semantics: Selected topics
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A typed calculus for querying distributed XML documents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
More on bisimulations for higher order π-calculus
Theoretical Computer Science
| Hi-index | 0.00 |
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduction semantics for CML by constructing a compositional operational semantics for a fragment of CML, based on higher-order process algebra. Using the operational semantics we generalise the notion of weak bisimulation equivalence to build a semantic theory of CML. We give some small examples of proofs about CML expressions, and show that our semantics corresponds to Reppy's up to weak first-order bisimulation.