Neil D. Jones

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 04:50, 18 February 2019 (Alter: author. Add: issue, isbn, series, volume. | You can use this bot yourself. Report bugs here. | User-activated.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Neil D. Jones
Born22 March 1941 (1941-03-22) (age 83)
Centralia, Illinois, United States
NationalityAmerican
CitizenshipDanish (since 1991)
Alma materUniversity of Western Ontario
Known forPartial evaluation, control-flow analysis, size-change termination
AwardsOrder of the Dannebrog (1998); SIGPLAN Programming Languages Achievement Award (2014)
Scientific career
FieldsComputer science
InstitutionsUniversity of Copenhagen
University of Aarhus
University of Kansas
Pennsylvania State University
University of Western Ontario
Doctoral advisorArto Salomaa

Neil D. Jones (born 22 March 1941 in Centralia, Illinois, USA) is an American computer scientist. He is currently Professor Emeritus in computer science at University of Copenhagen.

His work spans both programming languages and the theory of computation. Within programming languages he is particularly known for his work on partial evaluation and for pioneering work within both data-flow analysis, control-flow analysis[1] and termination analysis.[2] Within the theory of computation, he was among the pioneers of the study of Log-space reductions and P-completeness.[3]

Neil D. Jones is Knight of the Order of the Dannebrog (since 1998) and also a member of the Academia Europaea (since 1999). He is a 1998 Fellow of the Association for Computing Machinery for "outstanding contributions to semantics-directed compilation, especially partial evaluation, and to the theory of computation, formal models and their practical realization".[4]

External links

Selected publications

References

  1. ^ Neil D. Jones (1981), "Flow analysis of lambda expressions", Automata, Languages and Programming, Lecture Notes in Computer Science, 115: 114–128, doi:10.1007/3-540-10843-2_10, ISBN 978-3-540-10843-6
  2. ^ Chin Soon Lee, Neil D. Jones and Amir M. Ben-Amram (2001), "The size-change principle for program termination", Principles of Programming Languages, 36 (3): 81–92, doi:10.1145/373243.360210
  3. ^ Neil D. Jones and William T. Laaser (1974), "Complete Problems for Deterministic Polynomial Time", Symposium on the Theory of Computation: 40–46, doi:10.1145/800119.803883
  4. ^ "Neil D. Jones". Association for Computing Machinery. Retrieved 19 July 2017.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Neil_D._Jones&oldid=883877714"