John C. Reynolds

47 papers A* 11A 1B 2Misc 1Journal 15Unranked 15
YearRankTypeTitle / Venue / Authors
2012 A* conf
Syntactic control of interference for separation logic.
POPL
Uday S. Reddy, John C. Reynolds
2011 Misc conf
Making Program Logics Intelligible.
TASE
John C. Reynolds
2009 J jnl
Separation and information hiding.
ACM Trans. Program. Lang. Syst.
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
2009 A conf
Using Category Theory to Design Programming Languages.
ESOP
John C. Reynolds
2008 J jnl
Local reasoning about a copying garbage collector.
ACM Trans. Program. Lang. Syst.
Noah Torp-Smith, Lars Birkedal, John C. Reynolds
2008 — conf
Readable Formal Proofs.
VSTTE
John C. Reynolds
2008 J jnl
Some thoughts on teaching programming and programming languages.
ACM SIGPLAN Notices
John C. Reynolds
2005 — conf
An Overview of Separation Logic.
VSTTE
John C. Reynolds
2004 A* conf
Local reasoning about a copying garbage collector.
POPL
Lars Birkedal, Noah Torp-Smith, John C. Reynolds
2004 A* conf
Separation and information hiding.
POPL
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
2004 — conf
Toward a Grainless Semantics for Shared-Variable Concurrency.
FSTTCS
John C. Reynolds
2002 A* conf
Separation Logic: A Logic for Shared Mutable Data Structures.
LICS
John C. Reynolds
2001 B conf
Local Reasoning about Programs that Alter Data Structures.
CSL
Peter W. O'Hearn, John C. Reynolds, Hongseok Yang
2000 — conf
An Intrinsic Semantics of Intersection Types.
ICALP Satellite Workshops
John C. Reynolds
2000 J jnl
From Algol to polymorphic linear lambda-calculus.
J. ACM
Peter W. O'Hearn, John C. Reynolds
2000 J jnl
The design, definition and implementation of programming languages.
ACM SIGSOFT Softw. Eng. Notes
John C. Reynolds
1998 J jnl
Definitional Interpreters Revisited.
High. Order Symb. Comput.
John C. Reynolds
1998 J jnl
Definitional Interpreters for Higher-Order Programming Languages.
High. Order Symb. Comput.
John C. Reynolds
1998 — book
Theories of programming languages.
John C. Reynolds
1997 J jnl
Beyond ML.
ACM SIGPLAN Notices
John C. Reynolds
1996 J jnl
Beyond ML.
ACM Comput. Surv.
John C. Reynolds
1995 A* conf
Using Functor Categories to Generate Intermediate Code.
POPL
John C. Reynolds
1993 A* conf
An Introduction to Logical Relations and Parametric Polymorphism - Tutorial.
POPL
John C. Reynolds
1993 J jnl
On Functors Expressible in the Polymorphic Typed Lambda Calculus
Inf. Comput.
John C. Reynolds, Gordon D. Plotkin
1993 J jnl
The Discoveries of Continuations.
LISP Symb. Comput.
John C. Reynolds
1991 — conf
The Coherence of Languages with Intersection Types.
TACS
John C. Reynolds
1991 B conf
Types, Abstractions, and Parametric Polymorphism, Part 2.
MFPS
Qingming Ma, John C. Reynolds
1989 A* conf
Syntactic Control of Inference, Part 2.
ICALP
John C. Reynolds
1987 A* conf
Conjunctive Types and Algol-like Languages
LICS
John C. Reynolds
1985 — conf
Three Approaches to Type Structure.
TAPSOFT, Vol.1
John C. Reynolds
1984 — conf
Polymorphism is not Set-Theoretic.
Semantics of Data Types
John C. Reynolds
1983 — conf
An Introduction to Specification Logic.
Logic of Programs
John C. Reynolds
1983 — conf
Types, Abstraction and Parametric Polymorphism.
IFIP Congress
John C. Reynolds
1981 — book
The craft of programming.
John C. Reynolds
1980 J jnl
Reasoning about arrays.
ACM SIGPLAN Notices
John C. Reynolds
1980 — conf
Using category theory to design implicit conversions and generic operators.
Semantics-Directed Compiler Generation
John C. Reynolds
1979 J jnl
Reasoning About Arrays.
Commun. ACM
John C. Reynolds
1978 A* conf
Syntactic Control of Interference.
POPL
John C. Reynolds
1977 J jnl
Semantics of the Domain of Flow Diagrams.
J. ACM
John C. Reynolds
1975 A* ed.
Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, California, USA, January 1975
POPL
Robert M. Graham, Michael A. Harrison, John C. Reynolds
1974 A* conf
On the Relation between Direct and Continuation Semantics.
ICALP
John C. Reynolds
1974 — conf
Towards a theory of type structure.
Symposium on Programming
John C. Reynolds
1972 — conf
Definitional interpreters for higher-order programming languages.
ACM Annual Conference (2)
John C. Reynolds
1970 J jnl
GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept.
Commun. ACM
John C. Reynolds
1968 — conf
A generalized resolution principle based upon context-free grammars.
IFIP Congress (2)
John C. Reynolds
1968 — conf
Automatic computation of data set definitions.
IFIP Congress (1)
John C. Reynolds
1965 — conf
Programming languages for non-numeric processing - 2: An introduction to the COGENT programming system.
ACM National Conference
John C. Reynolds