Sciweavers

1000 search results - page 175 / 200
» Nominal rewriting systems
Sort
View
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
CADE
2003
Springer
14 years 9 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 8 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 8 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
VLDB
2007
ACM
146views Database» more  VLDB 2007»
14 years 8 months ago
A Cost-Estimation Component for Statement Sequences
Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is ...
Tobias Kraft