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...
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 ...
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...
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...
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. ...