Skip to main content
SpringerLink
Log in
Book cover

Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems)

REX 1993: A Decade of Concurrency Reflections and Perspectives pp 92–123Cite as

Some Chemical Abstract Machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 803))

Abstract

This paper explains by a series of examples the use of the notion of a Chemical Abstract Machine. This is a framework for parallel computations which builds upon the chemical metaphor of Banâtre and Le Métayer. We first illustrate the CHAM style by describing the operational semantics of process calculi constructs. Then we apply our approach to the λ-calculus, designing a CHAM for the weak β-reduction with sharing, and specializing it into a CHAM for the call-by-need reduction strategy. Our last example is the π-calculus. We discuss the notions of “asynchronous” and “fully asynchronous” reductions, and some π-calculus encodings of the λ-calculus.

This work has been partly supported by the BRA CONFER, and by the Project 502-1 of the Indo-French Centre for the Promotion of Advanced Research.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy, Explicit substitutions, J. of Functional Programming 1 (1991) 375–416.

    Google Scholar 

  2. S. Abramsky, The lazy lambda-calculus, in Research Topics in Functional Programming (D. Turner, Ed.), Addison-Wesley (1989) 65–116.

    Google Scholar 

  3. S. Abramsky, Computational interpretations of Linear Logic, Theoretical Comput. Sci. 111 (1993) 3–57.

    Google Scholar 

  4. J.-P. Banâtre, A. Coutant, D. Le Métayer, A parallel machine for multiset transformations and its programming style, Future Generation Comput. Systems 4 (1988) 133–144.

    Google Scholar 

  5. J.-P. Banâtre, D. Le Métayer, Tie Gamma model and its discipline of programming, Science Comput. Programming 15 (1990) 55–77.

    Google Scholar 

  6. J.-P. Banâtre, D. Le Métayer, Programming by multiset transformations, CACM 36 (1993) 98–111.

    Google Scholar 

  7. G. Bellin, P.-J. Scott, On the π-calculus and Linear Logic, Tech. Report ECS-LFCS-92-232, University of Edinburgh (1992).

    Google Scholar 

  8. G. Berry, G. Boudol, The chemical abstract machine, POPL 90 (1990) 81–94.

    Google Scholar 

  9. G. Berry, G. Boudol, The chemical abstract machine, Theoretical Comput. Sci. 96 (1992) 217–248.

    Google Scholar 

  10. G. Boudol, Asynchrony and the π-calculus, INRIA Res. Report 1702 (1992).

    Google Scholar 

  11. P.-L. Curien, T. Hardin, J.-J. Lévy, Confluence properties of weak and strong calculi of explicit substitutions, INRIA Res. Rep. 1617 (1992).

    Google Scholar 

  12. R. de Nicola, M. Hennessy, CCS without τ's, TAPSOFT 87, Lecture Notes in Comput. Sci. 249 (1987) 138–152.

    Google Scholar 

  13. U. Engberg, M. Nielsen, A calculus of communicating systems with label passing, Daimi PB-208, Aarhus University (1986).

    Google Scholar 

  14. J. Field, On laziness and optimality in lambda interpreters: tools for specification and analysis, POPL 90 (1990) 1–15.

    Google Scholar 

  15. J.R.W. Glauert, L. Leth, B. Thomsen, A new process model for functions, in Term Graph Rewriting: Theory and Pratice, Eds. R Sleep, R Plasmeijer and M. van Eekelen, John Wiley & Sons (1993) 269–282.

    Google Scholar 

  16. M. Hennessy, An Algebraic Theory of Processes, MIT Press (1988).

    Google Scholar 

  17. K. Honda, M. Tokoro, An object calculus for asynchronous communication, ECOOP 91, Lecture Notes in Comput. Sci. 512 (1991) 133–147.

    Google Scholar 

  18. A. Jeffrey, A chemical abstract machine for graph reduction, Tech. Report 3/92, University of Sussex (1992).

    Google Scholar 

  19. L. Leth, B. Thomsen, Some Facile chemistry, Tech. Report 92-14, ECRC (1992).

    Google Scholar 

  20. L. Maranget, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, POPL 91 (1991) 255–269.

    Google Scholar 

  21. R. Milner, Flowgraphs and Flow Algebras, JACM 26 (1979) 794–818.

    Google Scholar 

  22. R Milner, Communication and Concurrency, Prentice-Hall International Series in Computer Science (1989).

    Google Scholar 

  23. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Information and Computation 100 (1992) 1–77.

    Google Scholar 

  24. R. Milner, Functions as processes, Math. Struct. in Comp. Science 2 (1992) 119–141.

    Google Scholar 

  25. R. Milner, The polyadic π-calculus: a tutorial, Technical Report ECS-LFCS-91-180, Edinburgh University (1991).

    Google Scholar 

  26. R. Milner, D. Sangiorgi, Barbed bisimulation, ICALP 92, Lecture Notes in Comput. Sci. 623 (1992) 685–695.

    Google Scholar 

  27. R. Milner, Action structures, Technical Report ECS-LFCS-92-249, Edinburgh University

    Google Scholar 

  28. R. Milner, An action structure for synchronous π-calculus, FCT 93, Lecture Notes in Comput. Sci. 710 (1993) 87–105.

    Google Scholar 

  29. S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall International Series in Computer Science (1987).

    Google Scholar 

  30. G. Plotkin, A structural approach to operational semantics, Daimi FN-19, Aarhus University (1981).

    Google Scholar 

  31. D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, Department of Computer Science, The University of Edinburgh (1993).

    Google Scholar 

  32. N. Yoshida, Optimal reduction in weak λ-calculus with shared environments, Proc. of Functional Programming and Computer Architecture 93 (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, BP 93, 06902, Sophia Antipolis Cedex, France

    Gérard Boudol

Authors
  1. Gérard Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker W. -P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, G. (1994). Some Chemical Abstract Machines. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) A Decade of Concurrency Reflections and Perspectives. REX 1993. Lecture Notes in Computer Science, vol 803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58043-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-58043-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58043-0

  • Online ISBN: 978-3-540-48423-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation