83 search results - page 8 / 17 » A compact fixpoint semantics for term rewriting systems |
ENTCS
2006
13 years 8 months ago
2006
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...
ESSLLI
2009
Springer
13 years 6 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
FMSB
2008
13 years 10 months ago
2008
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
JLP
2010
13 years 3 months ago
2010
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...