1458 search results - page 34 / 292 » Extended Term Rewriting Systems |
RCC
2002
14 years 9 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...
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
CSL
2010
Springer
14 years 10 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...
CTRS
1987
15 years 1 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
111
click to vote
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...