ACL
1996
13 years 5 months ago
1996
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
IJCAI
1997
13 years 5 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
NAACL
2001
13 years 5 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
IASTEDSEA
2004
13 years 5 months ago
2004
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
LCPC
1995
Springer
13 years 8 months ago
1995
Springer
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
SIGMOD
1992
ACM
13 years 8 months ago
1992
ACM
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
PPSN
1994
Springer
13 years 8 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
CONPAR
1994
13 years 8 months ago
1994
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
The goal of the COKO-KOLA project [10, 91 is to express rules of rule-basedoptimizers in a mannerpermitting verification with a theoremprover. In [IO], we consideredquerytransform...
TYPES
1998
Springer
13 years 8 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...