PEPM
1993
ACM
14 years 1 days 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
14 years 1 days 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
14 years 1 days 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
14 years 1 days ago
1993
ACM
PEPM
1993
ACM
14 years 1 days 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
14 years 1 days 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...
OOPSLA
1993
Springer
14 years 1 days ago
1993
Springer
iam Pugh. Advice to authors of extended abstracts. http://www.acm.org/sigplan/conferences/author-info/pughadvice.html. [7] Mary Shaw. Writing good software engineering research pap...
ISSTA
1994
ACM
14 years 1 days ago
1994
ACM
CSEE
1992
Springer
14 years 1 days ago
1992
Springer
IUI
1993
ACM
14 years 1 days ago
1993
ACM
The goal of this paper is to model an agent who dislikes large choice sets because of the “cost of thinking” involved in choosing from them. We take as a primitive a preferenc...