226 search results - page 21 / 46 » Extensional Theories and Rewriting |
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
CCL
1994
Springer
14 years 28 days ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
ENTCS
2008
13 years 9 months ago
2008
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
ENTCS
2008
13 years 9 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
WADT
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...