Sciweavers

23201 search results - page 85 / 4641
» Rewriting Systems with Data
Sort
View
168
Voted
CCL
1994
Springer
15 years 9 months ago
On Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
Christian Prehofer
151
Voted
LFP
1990
171views more  LFP 1990»
15 years 6 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell
156
Voted
EDBT
2009
ACM
135views Database» more  EDBT 2009»
15 years 10 months ago
Provenance for nested subqueries
Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance fun...
Boris Glavic, Gustavo Alonso
161
Voted
ANCS
2007
ACM
15 years 9 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
177
Voted
PVLDB
2008
167views more  PVLDB 2008»
15 years 4 months ago
Managing and querying transaction-time databases under schema evolution
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...