Skip to search formSkip to main contentSkip to account menu
Partial evaluation and automatic program generation
TLDR
This paper presents a guide to the literature the self-applicable scheme specializer, a partial evaluator for a subset of scheme for a first-order functional languages.
The size-change principle for program termination
TLDR
This work establishes the problem's intrinsic complexity, and gives a direct algorithm operating on "size-change graphs" (without the passage to automata), which turns out to be surprisingly high, complete for PSPACE, in spite of the simplicity of the principle.
View on ACM
Space-Bounded Reducibility among Combinatorial Problems
  • N. Jones
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 1 August 1975
View via Publisher
Flow analysis and optimization of LISP-like structures
TLDR
Methods for determining the class of shapes which an unbounded data object may assume during execution of a LISP-like program are provided, and a number of uses to which that information may be put to improve storage allocation in compilers and interpreters for advanced programming languages are described.
View on ACM
Computability and complexity - from a programming perspective
  • N. Jones
  • Computer Science
    Foundations of computing series
  • 14 March 1997
TLDR
These notes contain some high points from the recent book, emphasising what is different or novel with respect to more traditional treatments of computability and complexity theory, and some new results as well.
View via Publisher
A positive supercompiler
TLDR
A positive supercompilers is introduced, a version of Turchin's supercompiler maintaining only positive information during transformation, and using folding without generalization to obtain an efficient matcher very similar to the Knuth–Morris–Pratt algorithm.
View on Cambridge Press
An experiment in partial evaluation: the generation of a compiler generator
TLDR
A running, non-trivial partial evaluator is described, which is the first which has been used in practice to transform interpreters into corresponding stand-alone compilers, or to generate a compile r generator by transforming itself.
View on ACM
A flexible approach to interprocedural data flow analysis and programs with recursive data structures
A new approach to data flow analysis of procedural programs and programs with recursive data structures is described. The method depends on simulation of the interpreter for the subject programming…
View on ACM
Complexity of Some Problems in Petri Nets
View via Publisher
An introduction to partial evaluation
  • N. Jones
  • Computer Science
    CSUR
  • 1 September 1996
TLDR
Partial evaluation provides a unifying paradigm for a broad spectrum of work in program optimization compiling interpretation and the generation of automatic program generators and has important applications to scientific computing, logic programming, metaprogramming, and expert systems.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License