article

A Generalized Higher-Order Chemical Computation Model

Authors:

J. -P. Banâtre,

P. Fradet,

Y. RadenacAuthors Info & Claims

Electronic Notes in Theoretical Computer Science (ENTCS), Volume 135, Issue 3

Pages 3 - 13

https://doi.org/10.1016/j.entcs.2005.09.016

Published: 01 March 2006 Publication History

Abstract

Gamma is a programming model where computation is seen as chemical reactions between data represented as molecules floating in a chemical solution. Formally, this model is represented by the rewriting of a multiset where rewrite rules model the chemical reactions. Recently, we have proposed the @c-calculus, a higher-order extension, where the rewrite rules are first-class citizen. The work presented in this paper increases further the expressivity of the chemical model with generalized multisets: multiplicities of elements may be infinite and/or negative. Applications of these new notions are illustrated by some programming examples.

References

[1]

Banâtre, J.-P., Fradet, P. and Le Métayer, D., Gamma and the chemical reaction model: Fifteen years after. In: LNCS, 2235. pp. 17-44.

Crossref

Google Scholar

[2]

Banâtre, J.-P., P. Fradet and Y. Radenac, Chemical programming with infinite and hybrid multisets, submitted for publication (available on request)

Google Scholar

[3]

Banâtre, J.-P., Fradet, P. and Radenac, Y., Higher-order programming style. In: LNCS, 3566.

Google Scholar

[4]

Banâtre, J.-P., Fradet, P. and Radenac, Y., Principles of chemical programming. ENTCS. v124. 133-147.

Google Scholar

[5]

Banâtre, J.-P. and Le Métayer, D., Programming by multiset transformation. Communications of the ACM (CACM). v36. 98-111.

Crossref

Google Scholar

[6]

Berry, G. and Boudol, G., The chemical abstract machine. Theoretical Computer Science. v96. 217-248.

Crossref

Google Scholar

[7]

Blizard, W., Negative membership. Notre Dame Journal of Formal Logic. v31. 346-368.

Google Scholar

[8]

Cohen, D. and Muylaert-Filho, J., Introducing a calculus for higher-order multiset programming. In: LNCS, 1061. pp. 124-141.

Crossref

Google Scholar

[9]

Le Métayer, D., Higher-order multiset programming. In: A.M.S. (AMS), (Ed.), Dimacs Series in Discrete Mathematics, 18.

Google Scholar

[10]

Loeb, D., Sets with a negative number of elements. Advances in Mathematics. v91. 4-74.

Google Scholar

[11]

Păun, G., Computing with membranes. Journal of Computer and System Sciences. v61. 108-143.

Crossref

Google Scholar

Cited By

View all

Mustafa SNazir BHayat AKhan AMadani S(2015)Resource management in cloud computingComputers and Electrical Engineering10.1016/j.compeleceng.2015.07.02147:C(186-203)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.compeleceng.2015.07.021
Hölzl MRauschmayer AWirsing M(2008)Engineering of Software-Intensive SystemsSoftware-Intensive Systems and New Computing Paradigms10.1007/978-3-540-89437-7_1(1-44)Online publication date: 14-Nov-2008
https://dl.acm.org/doi/10.1007/978-3-540-89437-7_1

A Generalized Higher-Order Chemical Computation Model
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

On Bisimulation Theory in Linear Higher-Order π-Calculus
Transactions on Petri Nets and Other Models of Concurrency III

Higher-order process calculi are an important branch of process model for its significance in both theory and practice. In this paper, we establish new results on bisimulation theory in linear higher-order π-calculus. By exploiting the properties of ...
Generalised multisets for chemical programming

Gamma is a programming model in which computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalised as associative, commutative, conditional rewritings of multisets ...
Higher-order abstract syntax in classical higher-order logic
LFMTP '09: Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice

Higher-Order Abstract Syntax, or HOAS, is a technique for using a higher-order logic as a metalanguage for an object language with binding operators. It avoids formalizing syntactic details related to variable binding. This paper gives an extension to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Electronic Notes in Theoretical Computer Science (ENTCS)

Electronic Notes in Theoretical Computer Science (ENTCS) Volume 135, Issue 3

March, 2006

142 pages

ISSN:1571-0661

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 March 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mustafa SNazir BHayat AKhan AMadani S(2015)Resource management in cloud computingComputers and Electrical Engineering10.1016/j.compeleceng.2015.07.02147:C(186-203)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.compeleceng.2015.07.021
Hölzl MRauschmayer AWirsing M(2008)Engineering of Software-Intensive SystemsSoftware-Intensive Systems and New Computing Paradigms10.1007/978-3-540-89437-7_1(1-44)Online publication date: 14-Nov-2008
https://dl.acm.org/doi/10.1007/978-3-540-89437-7_1

Abstract

References

Cited By

Recommendations

On Bisimulation Theory in Linear Higher-Order π-Calculus

Generalised multisets for chemical programming

Higher-order abstract syntax in classical higher-order logic

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations