273 search results - page 10 / 55 » A Compositional Semantics for Conditional Term Rewriting Sys... |
172
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
154
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
148
Voted
CSL
2010
Springer
15 years 6 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...
140
click to vote
ENTCS
2006
15 years 5 months ago
2006
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
219
Voted
LCPC
1992
Springer
15 years 10 months ago
1992
Springer
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...