Neil D. Jones
| Neil D. Jones | |
|---|---|
 | |
| Born |
22 March 1941 Centralia, Illinois, USA |
| Residence | Denmark |
| Citizenship | Danish (since 1991) |
| Nationality | American |
| Fields | Computer science |
| Institutions |
University of Copenhagen University of Aarhus University of Kansas Pennsylvania State University University of Western Ontario |
| Alma mater | University of Western Ontario |
| Doctoral advisor | Arto Salomaa |
| Known for | Partial evaluation, control-flow analysis, size-change termination |
| Notable awards | Order of the Dannebrog (1998); SIGPLAN Programming Languages Achievement Award (2014) |
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
- Neil D. Jones, Carsten K. Gomard, and Peter Sestoft: Partial Evaluation and Automatic Program Generation (1993) Book, full text available online.
- Neil D. Jones, Computability and Complexity from a Programming Perspective (1997) Book, published by MIT Press, online text is a revised and corrected version.
References
- ↑ Neil D. Jones (1981), "Flow analysis of lambda expressions", Automata, Languages and Programming: 114–128, doi:10.1007/3-540-10843-2_10
- ↑ Chin Soon Lee, Neil D. Jones and Amir M. Ben-Amram (2001), "The size-change principle for program termination", Principles of Programming Languages: 81–92, doi:10.1145/373243.360210
- ↑ 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
- ↑ "Neil D. Jones". Association for Computing Machinery. Retrieved 27 May 2014.