325 search results - page 27 / 65 » Abstract Rewriting |
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
WADT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
PARLE
1993
13 years 11 months ago
1993
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...