Sciweavers

37 search results - page 5 / 8
» Partial Inversion of Constructor Term Rewriting Systems
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 6 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
FUIN
2006
66views more  FUIN 2006»
13 years 6 months ago
Observation of String-Rewriting Systems
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
Matteo Cavaliere, Peter Leupold
WIDM
2003
ACM
13 years 12 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
TCS
2008
13 years 6 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini
LICS
1994
IEEE
13 years 10 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer