23201 search results - page 46 / 4641 » Rewriting Systems with Data |
AGP
1994
IEEE
14 years 1 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
RTA
1995
Springer
14 years 1 months ago
1995
Springer
In this paper we study normalization properties of rewrite systems that are typeable using intersection types with and with sorts. We prove two normalization properties of typeable...
TCS
2002
13 years 9 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
FSTTCS
1998
Springer
14 years 2 months ago
1998
Springer
In [NO88], a particular trace monoid M is constructed such that for the class of length