1385 search results - page 36 / 277 » Natural Rewriting for General Term Rewriting Systems |
106
click to vote
RTA
1991
Springer
15 years 5 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...
203
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
126
click to vote
BIRTHDAY
2005
Springer
15 years 7 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
112
click to vote
PADL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
130
click to vote
RCC
2002
15 years 1 months ago
2002
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...