Article

Free access

The chemical abstract machine

Authors:

Gerard BoudolAuthors Info & Claims

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 81 - 94

https://doi.org/10.1145/96709.96717

Published: 01 December 1989 Publication History

Abstract

We introduce a new kind of abstract machine based on the chemical metaphor used in the Γ language of Banâtre & al. States of a machine are chemical solutions where floating molecules can interact according to reaction rules. Solutions can be stratified by encapsulating subsolutions within membranes that force reactions to occur locally. We illustrate the use of this model by describing the operational semantics of the TCCS and CCS process calculi. We also show how to extract a higher-order concurrent λ-calculus out of the basic concepts of the chemical abstract machine.

References

[1]

Samson Abramsky. The lazy A-calculus. In D. Turner, editor, Declarative Programming, Addison Wesley, 1988.

[2]

Jean-Pierre Ban~tre, Anne Coutant, and Daniel Le Metayer. A parallel machine for multiset transformation and its programming style. In Future GencratiorL Computer Systems 4, pages 133-144, North-Holland, 1988.

Digital Library

[3]

Jean-Pierre Ban~tre and Daniel Le Metayer. A New Computational Model and lts Discipline of Programming. Technical Report INRIA Report 566, 1986.

[4]

Henk Barendregt. The T~pe-Free Larnbda- Calculus. Studies in Logic Volume 108, North- Holland, 1981.

[5]

Gdrard Berry. S~quentialitd de l'evaluation formelle des A-expressions. In B. Robinet, editor, Program Transformations 8rd International Colloquium on Programming, pages 67-80, DUNOD, Paxis, 1978.

[6]

Gdrard Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logic and Models of Concurrent Systems, NATO ASI Series F13, 1985.

Digital Library

[7]

Gdrard Boudol. Towards a lambda-calculus for concurrent snd communicating systems. In TAPSOFT 1989, Lecture Nbtes in Computer Science 351, pages 149-161, Springer-Verlag, 1989.

Digital Library

[8]

Nichol~ Carriero and David Gelerntner. Linda in context. Communications of the A CM, 32(4):444-458, 1989.

Digital Library

[9]

Mani Chandy and Jayadev Misra. Parallel Program Desigr~, a Foundation. Addison-Wesley, 1988.

Digital Library

[10]

Pierre-Louis Curien. Categorical Combirtetors, Sequential Algorithms, and Functional Program. ruing. Research Notes in Theoretical Computer Science, Pitman, London, John Wiley & Sons, New York, Toronto, 1986.

Digital Library

[11]

Philippe Darondeau. About fair asynchrony. Theoretical Computer Science, 37:305-336, 1985.

[12]

Rocco De Nicola. Extensional equivalences for transition systems. Acta Informatica, 24:211- 237, 1987.

Digital Library

[13]

Rocco De Nicola and Matthew Hennessy. COS without r's. In TAPSOFT 87, Lecture Notes in Computer Science/L~9, pages 138--152, Springer- Verlag, 1987.

[14]

Rocco De Nicola and Matthew Hennessy. Testing equivalences for processes. Theoretical Computer Science~ 34:83-133, 1984.

[15]

Matthew Hennessy. Observing processes. In Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Note~ in Computer Science 35~, pages 173- 200, Springer-Verlag, 1989.

[16]

C.A.R. Hoaxe. Communicating Sequential Pro. cesses. Prentice Hall, 1985.

[17]

Peter Landin. The mechanical evaluation of expressions. Computer Journal, 6:308-320, 1964.

[18]

Robin Milner. Communication and Concur. renc y. International Series in Computer Sei. ence, Prentice Hall, 1989.

Digital Library

[19]

Robin Milner. Program Semantics and Mechanized Proofs, pages 3-44. Mathematical Center Tracts 82, Amsterdam, 1976.

[20]

Robin Milner, Joachim Parrow, and David W~lker. A Calculus of Mobile Processes. Technical Report ECS-LFCS-89-85, LFCS, Edinburgh University, 1989.

[21]

Bengt Thomsen. A calculus of higher-order communicating systems. In Proc. 16th A CM Annual Symposium on Principles of Programming Languages, pages 143-154, 1989.

Digital Library

Cited By

Lindenhovius BMislove MZamdzhiev V(2023)Semantics for a Lambda Calculus for String DiagramsSamson Abramsky on Logic and Structure in Computer Science and Beyond10.1007/978-3-031-24117-8_26(973-1003)Online publication date: 2-Aug-2023
https://doi.org/10.1007/978-3-031-24117-8_26
Melgratti HMezzina CPinna G(2022)A Petri net view of covalent bondsTheoretical Computer Science10.1016/j.tcs.2022.01.013908:C(89-119)Online publication date: 24-Mar-2022
https://dl.acm.org/doi/10.1016/j.tcs.2022.01.013
Vassor M(2021)Reversibility and PredictionsReversible Computation10.1007/978-3-030-79837-6_10(163-181)Online publication date: 23-Jun-2021
https://doi.org/10.1007/978-3-030-79837-6_10
Show More Cited By

Recommendations

Network predicting drug’s anatomical therapeutic chemical code

Motivation: Discovering drug’s Anatomical Therapeutic Chemical (ATC) classification rules at molecular level is of vital importance to understand a vast majority of drugs action. However, few studies attempt to annotate drug’s potential ATC-codes by ...
Chemical Graphs, Chemical Reaction Graphs, and Chemical Graph Transformation

Chemical reactions are described by edge relabeling graph transformation rules, in which a substrate chemical graph is transformed into a product chemical graph by breaking existing bonds and creating new bonds between atoms. These edge relabeling graph ...
Mechanistic chemical reaction prediction using machine learning

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

December 1989

401 pages

ISBN:0897913434

DOI:10.1145/96709

Chairman:
Frances E. Allen

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

169
Total Citations
View Citations
1,826
Total Downloads

Downloads (Last 12 months)218
Downloads (Last 6 weeks)33

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lindenhovius BMislove MZamdzhiev V(2023)Semantics for a Lambda Calculus for String DiagramsSamson Abramsky on Logic and Structure in Computer Science and Beyond10.1007/978-3-031-24117-8_26(973-1003)Online publication date: 2-Aug-2023
https://doi.org/10.1007/978-3-031-24117-8_26
Melgratti HMezzina CPinna G(2022)A Petri net view of covalent bondsTheoretical Computer Science10.1016/j.tcs.2022.01.013908:C(89-119)Online publication date: 24-Mar-2022
https://dl.acm.org/doi/10.1016/j.tcs.2022.01.013
Vassor M(2021)Reversibility and PredictionsReversible Computation10.1007/978-3-030-79837-6_10(163-181)Online publication date: 23-Jun-2021
https://doi.org/10.1007/978-3-030-79837-6_10
Zhang LLong YCao YWang H(2019)Probabilistic Context-Aware Ambients10.1007/978-981-13-7983-3_23(255-267)Online publication date: 28-Apr-2019
https://doi.org/10.1007/978-981-13-7983-3_23
Åman Pohjola J(2019)Psi-Calculi Revisited: Connectivity and CompositionalityFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-030-21759-4_1(3-20)Online publication date: 29-May-2019
https://doi.org/10.1007/978-3-030-21759-4_1
Peters KNestmann U(2018)On the Distributability of Mobile AmbientsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.276.9276(104-121)Online publication date: 24-Aug-2018
https://doi.org/10.4204/EPTCS.276.9
(2017)Syllogistic reasoning by strand algebraInternational Journal of Bio-Inspired Computation10.1504/IJBIC.2017.08533110:1(56-66)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1504/IJBIC.2017.085331
Schröder MLüdtke SBader SKrüger FKirste T(2017)LiMa: Sequential Lifted Marginal Filtering on Multiset State DescriptionsKI 2017: Advances in Artificial Intelligence10.1007/978-3-319-67190-1_17(222-235)Online publication date: 19-Sep-2017
https://doi.org/10.1007/978-3-319-67190-1_17
He BDong LXu TFei SZhang HWang W(2017) Research on network programming language and policy conflicts for SDN Concurrency and Computation: Practice and Experience10.1002/cpe.421829:19Online publication date: 20-Jun-2017
https://doi.org/10.1002/cpe.4218
Hernández-Martínez JJuárez-Martínez UFuentes LBatory DCzarnecki K(2016)Model for fusion of software componentsCompanion Proceedings of the 15th International Conference on Modularity10.1145/2892664.2892688(143-145)Online publication date: 14-Mar-2016
https://dl.acm.org/doi/10.1145/2892664.2892688
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents