John C. Reynolds
John C. Reynolds
John Charles Reynolds
June 1, 1935
|Died||April 28, 2013(aged 77)|
|Known for||continuations, definitional interpreters, defunctionalization, Forsythe, Gedanken, intersection types, polymorphic lambda calculus, relational parametricity, separation logic|
|Awards||Lovelace Medal (2010)|
|Thesis||Surface Properties of Nuclear Matter (1961)|
|Doctoral students||Benjamin C. Pierce|
Education and affiliationsEdit
John Reynolds studied at Purdue University and then earned a PhD in theoretical physics from Harvard University in 1961. He was a professor of Information science at Syracuse University from 1970 to 1986. From then until his death he was Professor of Computer Science at Carnegie Mellon University. He also held visiting positions at Aarhus University (Denmark), University of Edinburgh, Imperial College London, Microsoft Research (Cambridge) and Queen Mary, University of London (UK).
Reynolds's main research interest was in the area of programming language design and associated specification languages, especially concerning formal semantics. He invented the polymorphic lambda calculus (System F) and formulated the property of semantic parametricity; the same calculus was independently discovered by Jean-Yves Girard. He wrote a seminal paper on definitional interpreters, which clarified early work on continuations and introduced the technique of defunctionalization. He applied category theory to programming language semantics. He defined the programming languages Gedanken and Forsythe, known for its use of intersection types. He worked on a separation logic to describe and reason about shared mutable data structures.
He had been an editor of journals such as the Communications of the ACM and the Journal of the ACM. In 2001, he was appointed a Fellow of the ACM. He won the ACM SIGPLAN Programming Language Achievement Award in 2003, and the Lovelace Medal from the British Computer Society in 2010.
- The Craft of Programming, Prentice Hall International, 1981. ISBN 0-13-188862-5.
- Theories of Programming Languages, Cambridge University Press, 1998. ISBN 0-521-59414-6.
- "Transformational Systems and the Algebraic Structure of Atomic Formulas" (PDF). Machine Intelligence. 5: 135–151. 1970.
- "Towards a Theory of Type Structure". Colloque sur la Programmation. Paris, France. 1974. pp. 408–425. doi:10.1007/3-540-06859-7_148.
- "Types, Abstraction and Parametric Polymorphism" (PDF). Information Processing '83. 1983. pp. 513–523.
- "Separation Logic: A Logic for Shared Mutable Data Structures" (PDF). 17th IEEE Symposium on Logic in Computer Science (LICS 2002). pp. 55–74. doi:10.1109/LICS.2002.1029817.
- Olivier Danvy, Peter O'Hearn and Philip Wadler (editors), "Festschrift for John C. Reynolds's 70th Birthday". Theoretical Computer Science, 375(1–3):1–350, 1 May 2007. Editorial, pages 1–2. doi:10.1016/j.tcs.2006.12.024
- Stephen Brookes, Peter O'Hearn and Uday Reddy, "The Essence of Reynolds". POPL 2014, pages 251-256. doi:10.1145/2535838.2537851