Advertisement

Towards a semantic theory of CML

Extended abstract
  • W. Ferreira
  • M. Hennessy
Contributed Papers Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)

Abstract

A simple untyped language based on CML, Concurrent ML, is defined and analysed. The language contains a spawn operator for initiating new independent threads of computation and constructs for the exchange of data between these threads. A denotational model for the language is presented where denotations correspond to computations of values rather than simply values. It is shown to be fully abstract with respect to a behavioural preorder based on contextual testing.

Keywords

Parallel Operator Operational Semantic Label Transition System Natural Interpretation Boolean Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.C.M. Baeten and F.W. Vaandrager. An algebra for process creation. Acta Informatica, 29(4):303–334, 1992.CrossRefGoogle Scholar
  2. 2.
    Mourad Debabi. Integration des Paradigmes de Programmation Parallele, Fonctionnelle et Imperative: Fondement Semantiques. PhD thesis, Universite Paris-Sud, U.F.R Scientifique d'Orsay, July 1994.Google Scholar
  3. 3.
    R. Milner D. Berry and D. Turner. A Semantics for ML Concurrency Primitives. In Proceedings of the 19th ACM Symposium on Principles of Programmings Languages, 1992.Google Scholar
  4. 4.
    A. Giacalone, P. Mishra and S. Prasad. Facile: A symetric integration of concurrent and functional programming. In Proceedings of TAPSOFT 89 pp.184–209, Lecture Notes in Computer Science 352, Springer-Verlag, 1989.Google Scholar
  5. 5.
    Carl A. Gunter. Semantics of Programming Languages. MIT Press, Cambridge Massachusetts, 1992.Google Scholar
  6. 6.
    K. Havelund. The Fork Calculus: Towards a Logic for Concurrent ML. PhD thesis, Ecole Normale Superieur, Paris, 1994.Google Scholar
  7. 7.
    M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Massachusetts, 1988.Google Scholar
  8. 8.
    M. Hennessy and A. Ingolfsdottir. A Theory of Communicating Processes with Value-Passing. Report 7/91, School of Cognitive and Computing Sciences, Sussex University, 1991.Google Scholar
  9. 9.
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985.Google Scholar
  10. 10.
    A. Ingolfsdottir. Semantic Models for Communicating Processes with Value Passing. PhD thesis, University of Sussex, 1994.Google Scholar
  11. 11.
    R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.Google Scholar
  12. 12.
    E. Moggi. Computational Lambda Calculus and Monads. Report ECS-LFCS-88-66, Edinburgh LFCS, 1988.Google Scholar
  13. 13.
    James Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, June 1968.Google Scholar
  14. 14.
    F. Nielson and H.R. Nielson. From CML to Process Algebras Technical Report DAIMI PB-433 Computer Science Department, Aarhus University, March 1993.Google Scholar
  15. 15.
    G.D. Plotkin. Lecture notes in domain theory, 1981. University of Edinburgh.Google Scholar
  16. 16.
    John Reppy. Higher-Order Concurrency. PhD thesis, Cornell University, June 1992. Technical Report TR 92-1285.Google Scholar
  17. 17.
    W. Ferreira and M. Hennessy Towards a Semantic Theory of CML. Sussex University Technical Report CS-02-95, Department of Computer Science, 1995.Google Scholar
  18. 18.
    Bent Thomsen. A calculus of higher order communicating systems. PhD thesis, Imperial College of Science, Technology and Medicine, Department of Computing, September 1990.Google Scholar
  19. 19.
    M.Tofte, R.Milner and R.Harper. The Definition of Standard ML. MIT Press, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • W. Ferreira
    • 1
  • M. Hennessy
    • 1
  1. 1.University of SussexUK

Personalised recommendations