BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Finland
1 × Germany
1 × Israel
1 × Italy
1 × Spain
18 × USA
2 × United Kingdom
3 × France
Collaborated with:
∅ S.S.Muchnick A.J.Glenstrup A.Mycroft G.W.Hamilton R.R.Hansen N.Bohr M.Rosendahl C.M.Madsen D.A.Schmidt S.Skyum W.T.Laaser A.L.Selman Daniil Berezun R.Giacobazzi I.Mastroeni M.Heizmann A.Podelski C.S.Lee A.M.Ben-Amram M.H.Sørensen R.Glück P.Sestoft H.Søndergaard D.Lacey E.V.Wyk C.C.Frederiksen
Talks about:
program (11) analysi (9) evalu (8) partial (7) termin (7) generat (6) time (6) compil (4) flow (4) bind (4)

Person: Neil D. Jones

DBLP DBLP: Jones:Neil_D=

Facilitated 7 volumes:

VMCAI 2009Ed
POPL 2004Ed
POPL 1997Ed
PEPM 1995Ed
ESOP 1990Ed
ESOP 1990Ed
SDCG 1980Ed

Contributed to:

PEPM 20122012
SAS 20102010
VMCAI 20082008
RTA 20042004
GPCE 20022002
ICFP 20022002
POPL 20022002
PPDP 20022002
IJCAR 20012001
POPL 20012001
SAS 19971997
PEPM 19951995
ALP 19941994
ESOP 19941994
ILPS 19941994
STOC 19931993
ICALP 19901990
POPL 19861986
RTA 19851985
SLP 19841984
LFP 19821982
POPL 19821982
ICALP 19811981
SDCG 19801980
POPL 19791979
ICALP 19771977
POPL 19761976
POPL 19751975
STOC 19741974
STOC 19721972
PEPM 20172017

Wrote 33 papers:

PEPM-2012-GiacobazziJM #obfuscation #partial evaluation
Obfuscation by partial evaluation of distorted interpreters (RG, NDJ, IM), pp. 63–72.
PEPM-2012-HamiltonJ #lts
Distillation with labelled transition systems (GWH, NDJ), pp. 15–24.
SAS-2010-HeizmannJP #invariant #termination
Size-Change Termination and Transition Invariants (MH, NDJ, AP), pp. 22–50.
VMCAI-2008-JonesH
CTL as an Intermediate Language (NDJ, RRH), p. 4.
RTA-2004-JonesB #analysis #calculus #termination
Termination Analysis of the Untyped lamba-Calculus (NDJ, NB), pp. 1–23.
GPCE-2002-JonesG #analysis #generative #termination
Program Generation, Termination, and Binding-Time Analysis (NDJ, AJG), pp. 1–31.
ICFP-2002-JonesG #analysis #generative #termination
Program generation, termination, and binding-time analysis (NDJ, AJG), p. 283.
POPL-2002-LaceyJWF #compilation #correctness #logic #optimisation #proving
Proving correctness of compiler optimizations by temporal logic (DL, NDJ, EVW, CCF), pp. 283–294.
PPDP-2002-JonesG #analysis #generative #termination
Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis (NDJ, AJG), p. 1.
IJCAR-2001-Jones #analysis #graph #termination
Program Termination Analysis by Size-Change Graphs (NDJ), pp. 1–4.
POPL-2001-LeeJB #termination
The size-change principle for program termination (CSL, NDJ, AMBA), pp. 81–92.
SAS-1997-Jones #abstract interpretation #overview #partial evaluation
Combining Abstract Interpretation and Partial Evaluation (Brief Overview) (NDJ), pp. 396–405.
PEPM-1995-Jones #years after
Special Address: MIX ten years after (NDJ), pp. 24–38.
ALP-1994-JonesR #functional #graph #higher-order
Higher-Order Minimal Functional Graphs (NDJ, MR), pp. 242–252.
ESOP-1994-SorensenGJ #deforestation #partial evaluation #supercompilation #towards
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC (MHS, RG, NDJ), pp. 485–500.
ILPS-1994-Jones #abstract interpretation #functional #logic programming #partial evaluation
Abstract Interpretation and Partial Evaluation in Functional and Logic Programming (NDJ), pp. 17–22.
STOC-1993-Jones #constant #matter
Constant time factors do matter (NDJ), pp. 602–611.
ICALP-1990-Jones #partial evaluation #self
Partial Evaluation, Self-Application and Types (NDJ), pp. 639–659.
POPL-1986-JonesM #analysis #data flow #graph #source code #using
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
RTA-1985-JonesSS #compilation #empirical #generative #partial evaluation
An Experiment in Partial Evaluation: The Generation of a Compiler Generator (NDJ, PS, HS), pp. 124–140.
SLP-1984-JonesM84 #development #prolog #semantics
Stepwise Development of Operational and Denotational Semantics for Prolog (NDJ, AM), pp. 281–288.
LFP-1982-MuchnickJ #combinator #evaluation
A Fixed-Program Machine for Combinator Expression Evaluation (SSM, NDJ), pp. 11–20.
POPL-1982-JonesM #analysis #approach #data flow #data type #flexibility #interprocedural #recursion #source code
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.
ICALP-1981-Jones #analysis
Flow Analysis of λ Expressions (NDJ), pp. 114–128.
SDCG-1980-JonesM #lr #parsing
Attribute-influenced LR parsing (NDJ, CMM), pp. 393–407.
SDCG-1980-JonesS #compilation #generative #semantics
Compiler generation from denotational semantics (NDJ, DAS), pp. 70–93.
POPL-1979-JonesM #analysis #optimisation
Flow Analysis and Optimization of Lisp-Like Structures (NDJ, SSM), pp. 244–256.
ICALP-1977-JonesS #complexity #problem
Complexity of Some Problems Concerning L Systems (NDJ, SS), pp. 301–308.
POPL-1976-JonesM #design #optimisation #programming language #towards
Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language (NDJ, SSM), pp. 77–94.
POPL-1975-JonesM #source code
Even Simple Programs are Hard to Analyze (NDJ, SSM), pp. 106–118.
STOC-1974-JonesL #polynomial #problem
Complete Problems for Deterministic Polynomial Time (NDJ, WTL), pp. 40–46.
STOC-1972-JonesS #first-order #similarity #turing machine
Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.
PEPM-2017-BerezunJ #compilation #game studies #partial evaluation #semantics #λ-calculus
Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper) (DB, NDJ), pp. 1–11.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.