12 search results - page 2 / 3 » ershov 1999 |
ERSHOV
1999
Springer
13 years 9 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
ERSHOV
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Monads are a technique widely used in functional programming languages to address many different problems. This paper presents extensions, a functional-logic programming...
ERSHOV
1999
Springer
13 years 9 months ago
1999
Springer
A semi-visual framework for the speci cation of syntax and semantics of imperative programming languages, called Montages, was proposed in an earlier work by the authors. The prima...
ERSHOV
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Existing partial evaluators usually fix the strategy for binding-time analysis. But a single strategy cannot fulfill all goals without leading to compromises regarding ...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...