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 where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article we generalise the notion of multiset used by Gamma and present applications through various programming examples. First, multisets are generalised to include rewrite rules, which become first-class citizens. This extension is formalised by the $gamma$-calculus, which is a chemical model that summarises in a few rules the essence of higher-order chemical programming. By extending the $gamma$-calculus with constants, operators, types and expressive patterns, we build a higher-order chemical programming language called HOCL. Finally, multisets are further generalised by allowing elements to have infinite and negative multiplicities. Semantics, implementation and applications of this extension are considered.
Keywords for this software
References in zbMATH (referenced in 7 articles , 1 standard article )
Showing results 1 to 7 of 7.
- Andrei, Oana; Kirchner, Hélène: Runtime verification for biochemical programs (2013)
- Bertier, Marin; Obrovac, Marko; Tedeschi, Cédric: Adaptive atomic capture of multiple molecules (2013)
- Fernández, Héctor; Tedeschi, Cédric; Priol, Thierry: Decentralized workflow coordination through molecular composition (2012)
- Andrei, Oana; Kirchner, Hélène: A port graph calculus for autonomic computing and invariant verification (2009)
- Andrei, Oana; Kirchner, Hélène: A higher-order graph calculus for autonomic computing (2009)
- Ban^atre, Jean-Pierre; Fradet, Pascal; Radenac, Yann: Classical coordination mechanisms in the chemical model (2009)
- Ban^atre, J.-P.; Fradet, P.; Radenac, Y.: Generalised multisets for chemical programming (2006)