Abstract
LCS is an experimental high level parallel programming language aimed at exploring design, implementation and use of programming languages based upon process calculi. LCS extends Standard ML with primitives for concurrency and communication based upon a higher order extension of the CCS formalism. The paper discusses language design, illustrates programming disciplines, and investigates abstract machines for sequential and parallel implementations of the language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Astesiano, E. Zucca, “Parametric channels via label expressions in CCS*”, Theoretical Computer Science. Vol 33. 1984.
B. Berthomieu, T. Le Sergent, “Programming with behaviors in an ML framework, The syntax and semantics of LCS”, European Symposium in Programming. Edinburgh. April 1994. Springer Verlag LNCS Vol 788, 1994.
B. Berthomieu, C. le Moniés de Sagazan, “A Calculus of Tagged Types, with Applications to Process Languages”, TAPSOFT Workshop on Types for Program Analysis, Aarhus. Denmark, May 95 (DAIMI report PB-493, University of Aarhus).
G. Berry, G. Boudol, “The Chemical Abstract Machine”, Theoretical Computer Science, Vol 96. pp. 217–248, Elseiver 1992.
W. H. Burge, “Recursive Programming Techniques”, Systems Programing Series, Addison Wesley, 1976.
G. A. Andrews, “Concurrent Programming. Principles and Practice”, Benjamin/Cummings Publishing Company. 1991.
A. Giacalone, P. Mishra, S. Prasad, “Facile: A symmetric integration of concurrent and functional programming”. Int. Journal of Parallel Programming, 18(2), April 1989.
ISO, “ISO-LOTOS, A Formal Description Technique based on the Temporal Ordering of Observational Behaviour”, Int. Standard ISO 8807, ISO, 1989.
T. Le Sergent, B. Berthomieu, “Incremental multi-threaded garbage collection on virtually shared memory architectures”. Int. Workshop on Memory Management, St. Malo, France, Sept. 1992.
T. Le Sergent, B. Berthomieu, “Balancing load under large and fast load changes in distributed computing systems — A case study”, CONPAR 94 — VAPP VI Third Joint Int. Conference on Vector and Parallel Processing, Linz, Austria, Sept. 94.
T. Le Sergent, “Méthodes d'exécution et machines virtuelles parallèles pour l'implantation distribuée du langage de programmation parallèle LCS”, Ph.D. thesis, Feb. 93.
D. Matthews, “A distributed concurrent implementation of Standard ML”, EurOpen Autumn 1991 Conference, Budapest, Hungary, 1991.
D. Matthews, T. Le Sergent, “LEMMA, A Distributed Shared Memory with Global and Local Garbage Collection”, Int. Workshop on Memory Management, Kinross, Scotland, Sept. 1995.
B. C. Pierce, D. Rémy, D. N. Turner, “A Typed Higher-Order Programming Language Based on the Pi-Calculus”, Edinburgh University, 1993.
R. Milner, Communication and Concurrency, Prentice Hall international series in Computer science, C.A.R. Hoare Ed, 1989.
R. Milner, J. Parrow, D. Walker, “A Calculus of Mobile Processes”, ECS-LFCS-89-85, LFCS report series. Edinburgh University, 1989.
C.M.P Reade, “Elements of Functional Programming”, International Computer Science Series, Addison Wesley, 1989.
J. H. Reppy, “CML: A higher-order concurrent language”, ACM SIGPLAN Conf. on Programming Language Design and Implementation, SIGPLAN Notices 26(6), 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthomieu, B. (1996). Process calculi at work — An account of the LCS project. In: Ito, T., Halstead, R.H., Queinnec, C. (eds) Parallel Symbolic Languages and Systems. PSLS 1995. Lecture Notes in Computer Science, vol 1068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023073
Download citation
DOI: https://doi.org/10.1007/BFb0023073
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61143-1
Online ISBN: 978-3-540-68332-2
eBook Packages: Springer Book Archive