Sciweavers

889 search results - page 50 / 178
» Problems in Rewriting III
Sort
View
ICFP
2009
ACM
14 years 10 months ago
A theory of typed coercions and its applications
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
Nikhil Swamy, Michael W. Hicks, Gavin M. Bierman
EDBT
2008
ACM
162views Database» more  EDBT 2008»
14 years 10 months ago
Schema merging and mapping creation for relational sources
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
Rachel Pottinger, Philip A. Bernstein
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
14 years 2 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
AISC
2008
Springer
13 years 12 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
AMAST
2008
Springer
13 years 12 months ago
System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries
We demonstrate Spiral, a domain-specific library generation system. Spiral generates high performance source code for linear transforms (such as the discrete Fourier transform and ...
Yevgen Voronenko, Franz Franchetti, Fréd&ea...