83 search results - page 4 / 17 » A compact fixpoint semantics for term rewriting systems |
SAS
1994
Springer
13 years 11 months ago
1994
Springer
We definea novelinference systemfor strictness andtotality analysisfor the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those t...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
IAJIT
2010
13 years 6 months ago
2010
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...