William Ferreira
ABSTRACT
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this papes 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. We use this to build a semantic theory for CML, based on weak bisimulation equivalence. 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.
- 1.ISO 8807. LOTOS--A formal description technique based on the temporal ordering of observational behaviour, 1989.Google Scholar
- 2.G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation. J. FunctionalProgramming, 1994.Google Scholar
- 3.J. C. M. Baeten and F. W. Vaan~ag~. An algebra for proc~s creation. Acta lnformatica, 29(4):303-334, 1992. Google ScholarDigital Library
- 4.J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction, Theoret. Comput. Sci., 37:77-121,1985.Google ScholarCross Ref
- 5.Dave Berry, Robin Milner, and David N. Turner. A semantics for ML concurrency primitives. In Proc. POPL 92, 1992. Google ScholarDigital Library
- 6.Dominique Bolignano and Mourad Debabi. A semantic theory for concurrent ML. In Proc. TACS '94, 1994. Google ScholarDigital Library
- 7.M. Debabi. Integration de Paradigmes de Programmation ParaUe, Fonctionnelle et Imperative. Ph.D thesis, Universite D'Orsay, 1994.Google Scholar
- 8.William Ferreira. Semantic Theories for Concurrent ML. D.Phil thesis, COGS, Sussex Univ., 1995. In preparation.Google Scholar
- 9.William Ferreira and Matthew Hennessy. Towards a semantic theory of CML. Technical report 95:02, COGS, Sussex Univ., 1995. available electronically from http://www, cogs.susx.ac.uk/Computer Science Technica/Reports/.Google Scholar
- 10.William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. COGS Comp. Sci. Tech. Report 05/95, Univ. Sussex, 1995. available electronically from http://www, cogs.susx.ac.uk/Computer Science Technical Reports/.Google Scholar
- 11.A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. In Proc. Tapsoft 89, volume 352 of LNCS, pages 184-209. Springer-Verlag, 1989. Google Scholar
- 12.Andrew Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS 95, number 1 in Electronic Notes in Comp. Sci. Springer-Verlag, 1995.Google Scholar
- 13.Carl Gunter. Semantics of Programming Languages. MIT Press, 1992. Google ScholarDigital Library
- 14.K. Havelund. The Fork Calculus: Towards a Logic for Concurrent ML. Ph.D thesis, ~,ole Normale Superieur, Paris, 1994.Google Scholar
- 15.M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988. Google ScholarDigital Library
- 16.C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. Google ScholarDigital Library
- 17.S~ren Holmstr~m. PFL: A functional language for paraUel programming. In Proc. Declarative Programming Workshop, pages 114-139, 1983.Google Scholar
- 18.Douglas Howe. Equality in lazy computation systems. In Proc. LICS 89, pages 198-203, 1989. Google ScholarDigital Library
- 19.Alan Jeffrey. A fully abstract semantics for a concurrent functional language with monadic types. In Proc. LICS 95, pages 255-264, 1995. Google ScholarDigital Library
- 20.Robin Milner. Communication and Concurrency. Prentice-Hall, 1989. Google ScholarDigital Library
- 21.Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile proceses. Inform. and Comput., 100(1):1-77, 1992. Google ScholarDigital Library
- 22.Eugenio Moggi. Notions of computation and monad. Inform. and Comput., 93:55-92, 1991. Google ScholarDigital Library
- 23.F. Nielson and H. R. Nielson. From CML to proc~s algebras. Report DAIMI FN-19, Dept. Comp. Sci., Aarhus University, 1993.Google Scholar
- 24.Sivaswami Nikhil. Id Reference Manual. MIT Lab. for Comp. Sci., 1990.Google Scholar
- 25.Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. Technical report in preparation; available electronically from http://www, cl.cam, ac.uk/users/bcp 1000/ftp/index.html, 1995.Google Scholar
- 26.John Reppy. A higher-order concurrent langauge. In Proc. SIGPLAN 91, pages 294-305, 1991. Google ScholarDigital Library
- 27.John Reppy. An operational semantics of first-class synchronous operations. Technical report TR 91-1232, Dept. Comp. Sci,, Comell Univ., 1991.Google Scholar
- 28.lohn Reppy. Higher-Order Concurrency. Ph.D thesis, Comell Univ., 1992. Google ScholarDigital Library
- 29.Davide Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. Ph.D thesis, LFCS, Edinburgh Univ., 1992.Google Scholar
- 30.Bent Thomsen. A theory of higher order communicating systems. Inform. and Comput., 116(1):38-57,1995. Google ScholarDigital Library
Index Terms
- A theory of weak bisimulation for core CML
Recommendations
A theory of weak bisimulation for Core CML
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 ...
A theory of weak bisimulation for core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this papes we build upon John Reppy's reduction semantics for CML by constructing a compositional operational semantics for ...
CML: A Meta‐Interpreter for Manufacturing
A new computer language for manufacturing is being used to link complex systems of equipment whose components are supplied by multiple vendors. The Cell Management Language (CML) combines computational tools from rule‐based data systems, object‐oriented ...
Comments