77 search results - page 4 / 16 » Presenting a Category Modulo a Rewriting System |
RTA
2011
Springer
12 years 8 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
CCL
1994
Springer
13 years 9 months 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
2002
13 years 5 months ago
2002
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
SCOPES
2005
Springer
13 years 10 months ago
2005
Springer
Software used in embedded systems is subject to strict timing and space constraints. The growing software complexity creates an urgent need for fast program execution under the co...
POPL
1994
ACM
13 years 9 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...