PEPM
1993
ACM
13 years 8 months ago
1993
ACM
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
PEPM
1993
ACM
13 years 8 months ago
1993
ACM
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
PEPM
1993
ACM
13 years 8 months ago
1993
ACM
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
PEPM
1993
ACM
13 years 8 months ago
1993
ACM
PEPM
1993
ACM
13 years 8 months ago
1993
ACM
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
PEPM
1993
ACM
13 years 8 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...