• Publications
  • Influence
Partial evaluation and automatic program generation
Functions, types and expressions programming languages and their operational semantics compilation partial evaluation of a flow chart languages partial evaluation of a first-order functionalExpand
Deriving a Lazy Abstract Machine
  • P. Sestoft
  • Computer Science
  • J. Funct. Program.
  • 1 May 1997
We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics and extending it with datatype constructors and base values. Expand
An experiment in partial evaluation: the generation of a compiler generator
The present paper is an extended abstract of (Jones 1985), in which a running , non-trivial partial evaluator is described, which is used in practice to transform interpreters into corresponding stand-alone compilers, or to generate a compile r generator by transforming itself . Expand
Mix: A self-applicable partial evaluator for experiments in compiler generation
This paper gives an introduction to partial evaluation and describes a fully automatic though experimental partial evaluator, called mix, able to generate stand-alone compilers as well as a compiler generator. Expand
Spreadsheet Implementation Technology: Basics and Extensions
Spreadsheets are used daily by millions of people for tasks that range from organizing a list of addresses to carrying out complex economic simulations. Expand
The structure of a self-applicable partial evaluator
  • P. Sestoft
  • Mathematics, Computer Science
  • Programs as Data Objects
  • 17 October 1985
An abstract interpretation of the subject program over a domain with two values for expressions, D = {Known, Unknown}. Expand
Decidability and Undecidability Results for Duration Calculus
Programming with regions in the ML Kit
The ML Kit with Regions is a Standard ML compiler. Expand
MK Pattern Match Compilation and Partial Evaluation
  • P. Sestoft
  • Computer Science
  • Dagstuhl Seminar on Partial Evaluation
  • 12 February 1996
We derive a compiler for ML-style pattern matches. It is conceptually simple and produces reasonably good compiled matches. The derivation is inspired by the instrumentation and partial evaluation ofExpand
Demonstrating Lambda Calculus Reduction
  • P. Sestoft
  • Computer Science, Mathematics
  • MFPS
  • 1 November 2001
We describe lambda calculus reduction strategies using big-step operational semantics and show how to efficiently trace such reductions. Expand