N. Jones

Publications195
h-index44
Citations9,173
Highly Influential Citations482
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • O. Danvy
  • 280 Publications • 6,487 Citations
  • R. Glück
  • 152 Publications • 3,476 Citations
  • C. Consel
  • 192 Publications • 5,341 Citations
  • Flemming Nielson
  • 333 Publications • 7,687 Citations
  • 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 functional… Expand
The size-change principle for program termination
TLDR
The "size-change termination" principle for first-order functional language with well-founded data is: a program terminates on all inputs if every infinite call sequence (following program control flow) would cause an infinite descent in some data values.Size-change analysis is based only on local approximations to parameter size changes derivable from program syntax. Expand
A Positive Supercompiler
TLDR
We introduce a positive supercompiler, a version of Turchin's super compiler maintaining only positive information during transformation, and using folding without generalization. Expand
Space-Bounded Reducibility among Combinatorial Problems
  • N. Jones
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1 August 1975
TLDR
Reducibility and completeness among combinatorial problems can be formulated in terms of space bounds, in some cases refining the polynomial time-reducibility of Cook and Karp. Expand
Computability and complexity - from a programming perspective
  • N. Jones
  • Mathematics, Computer Science
  • Foundations of computing series
  • 14 March 1997
TLDR
A programming approach to computability and complexity theory yields proofs of central results that are sometimes more natural than the classical ones; and some new results as well. Expand
Flow analysis and optimization of LISP-like structures
TLDR
We provide methods for determining the class of shapes which an unbounded data object may assume during execution of a LISP-like program, and describe a number of uses to which that information may be put to improve storage allocation in compilers and interpreters for advanced programming languages. Expand
An experiment in partial evaluation: the generation of a compiler generator
TLDR
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
A flexible approach to interprocedural data flow analysis and programs with recursive data structures
TLDR
A new approach to data flow analysis of procedural programs and programs with recursive data structures using a retrieval function to approximate a program's data structures is described. Expand
The expressive power of higher-order types or, life without CONS
  • N. Jones
  • Computer Science
  • Journal of Functional Programming
  • 1 January 2001
TLDR
This paper uses complexity theory to prove some expressivity results about small programming languages that are less than Turing complete by comparing first-order functional programs with higher-order programs allowing functions as function parameters. Expand
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 [Bjørner et al. 1987; Ershov 1992). Expand
...
1
2
3
4
5
...