John C. Reynolds

Uday S. Reddy, John C. Reynolds: Syntactic control of interference for separation logic. POPL 2012: 323-336

John C. Reynolds: Making Program Logics Intelligible. TASE 2011: 3-4

Peter W. O'Hearn, Hongseok Yang, John C. Reynolds: Separation and information hiding. ACM Trans. Program. Lang. Syst. 31(3) (2009)

John C. Reynolds: Using Category Theory to Design Programming Languages. ESOP 2009: 62-63

John C. Reynolds: Some thoughts on teaching programming and programming languages. SIGPLAN Notices 43(11): 108-110 (2008)

Noah Torp-Smith, Lars Birkedal, John C. Reynolds: Local reasoning about a copying garbage collector. ACM Trans. Program. Lang. Syst. 30(4) (2008)

John C. Reynolds: Readable Formal Proofs. VSTTE 2008: 1

John C. Reynolds: An Overview of Separation Logic. VSTTE 2005: 460-469

John C. Reynolds: Toward a Grainless Semantics for Shared-Variable Concurrency. FSTTCS 2004: 35-48

Lars Birkedal, Noah Torp-Smith, John C. Reynolds: Local reasoning about a copying garbage collector. POPL 2004: 220-231

Peter W. O'Hearn, Hongseok Yang, John C. Reynolds: Separation and information hiding. POPL 2004: 268-280

John C. Reynolds: Separation Logic: A Logic for Shared Mutable Data Structures. LICS 2002: 55-74

Peter W. O'Hearn, John C. Reynolds, Hongseok Yang: Local Reasoning about Programs that Alter Data Structures. CSL 2001: 1-19

Peter W. O'Hearn, John C. Reynolds: From Algol to polymorphic linear lambda-calculus. J. ACM 47(1): 167-223 (2000)

John C. Reynolds: The design, definition and implementation of programming languages. ACM SIGSOFT Software Engineering Notes 25(1): 75 (2000)

John C. Reynolds: An Intrinsic Semantics of Intersection Types. ICALP Satellite Workshops 2000: 269-270

John C. Reynolds: Theories of programming languages. Cambridge University Press 1998, isbn 978-0-521-59414-1, pp. I-XII, 1-500

John C. Reynolds: Definitional Interpreters Revisited. Higher-Order and Symbolic Computation 11(4): 355-361 (1998)

John C. Reynolds: Definitional Interpreters for Higher-Order Programming Languages. Higher-Order and Symbolic Computation 11(4): 363-397 (1998)

John C. Reynolds: Beyond ML. SIGPLAN Notices 32(1): 103-105 (1997)

John C. Reynolds: Beyond ML. ACM Comput. Surv. 28(4es): 172 (1996)

John C. Reynolds: Using Functor Categories to Generate Intermediate Code. POPL 1995: 25-36

John C. Reynolds, Gordon D. Plotkin: On Functors Expressible in the Polymorphic Typed Lambda Calculus. Inf. Comput. 105(1): 1-29 (1993)

John C. Reynolds: The Discoveries of Continuations. Lisp and Symbolic Computation 6(3-4): 233-248 (1993)

John C. Reynolds: An Introduction to Logical Relations and Parametric Polymorphism - Tutorial. POPL 1993: 155-156

QingMing Ma, John C. Reynolds: Types, Abstractions, and Parametric Polymorphism, Part 2. MFPS 1991: 1-40

John C. Reynolds: The Coherence of Languages with Intersection Types. TACS 1991: 675-700

John C. Reynolds: Syntactic Control of Inference, Part 2. ICALP 1989: 704-722

John C. Reynolds: Conjunctive Types and Algol-like Languages. LICS 1987: 119

John C. Reynolds: Three Approaches to Type Structure. TAPSOFT, Vol.1 1985: 97-138

John C. Reynolds: Polymorphism is not Set-Theoretic. Semantics of Data Types 1984: 145-156

John C. Reynolds: Types, Abstraction and Parametric Polymorphism. IFIP Congress 1983: 513-523

John C. Reynolds: An Introduction to Specification Logic. Logic of Programs 1983: 442

John C. Reynolds: The craft of programming. Prentice Hall International series in computer science, Prentice Hall 1981, isbn 978-0-13-188862-3, pp. I-XIII, 1-434

John C. Reynolds: Using category theory to design implicit conversions and generic operators. Semantics-Directed Compiler Generation 1980: 211-258

John C. Reynolds: Reasoning About Arrays. Commun. ACM 22(5): 290-299 (1979)

John C. Reynolds: Syntactic Control of Interference. POPL 1978: 39-46

John C. Reynolds: Semantics of the Domain of Flow Diagrams. J. ACM 24(3): 484-503 (1977)

Robert M. Graham, Michael A. Harrison, John C. Reynolds (Eds.): Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, California, USA, January 1975. ACM Press 1975

John C. Reynolds: On the Relation between Direct and Continuation Semantics. ICALP 1974: 141-156

John C. Reynolds: Towards a theory of type structure. Symposium on Programming 1974: 408-423

John C. Reynolds: GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept. Commun. ACM 13(5): 308-319 (1970)

John C. Reynolds: Automatic computation of data set definitions. IFIP Congress (1) 1968: 456-461

John C. Reynolds: A generalized resolution principle based upon context-free grammars. IFIP Congress (2) 1968: 1405-1411