The linear concurrent constraint programming language Euler
(Draft v 0.1)
Vijay Saraswat
IBM TJ Watson Research Center
March 31, 2004
Abstract
We present a simple applied linear concurrent constraint programming
(lcc) language, Euler, intended primarily for graph rewriting
applications, as in formal molecular biology. The language permits
set-forming operations in its term language, and the checking of
(in-)equality constraints, but does not allow the imposition of
equality constraints. Configurations may be understood as
(hyper-)graphs, with atomic formulas representing nodes and logical
variables representing (hyper-)edges, as usual. Rules may match and
replace arbitrary (finite) subgraphs, while adding new nodes and
edges.
The operational semantics of the language is specified by the general
lcc framework, specialized to permit reasoning about additional
operations.
We show that it can directly represent symbolic signaling pathways
in molecular biology, of the kind studied by Danos and Laneve.
Keywords:
linear concurrent constraint programming, lcc, Euler, graphs, graph-rewriting, formal molecular biology
@techreport{ccm-machines
title = {Euler: an applied lcc language for graph rewriting},
author = {Vijay Saraswat},
institution= {IBM {TJ} {W}atson {R}esearch {C}enter},
month = mar,
year = "2004"
}
Pdf file (118K), 6 pp