| 2009 |
|---|
| 36 | EE | John C. Reynolds:
Using Category Theory to Design Programming Languages.
ESOP 2009: 62-63 |
| 35 | EE | Peter W. O'Hearn,
Hongseok Yang,
John C. Reynolds:
Separation and information hiding.
ACM Trans. Program. Lang. Syst. 31(3): (2009) |
| 2008 |
|---|
| 34 | EE | John C. Reynolds:
Readable Formal Proofs.
VSTTE 2008: 1 |
| 33 | EE | Noah Torp-Smith,
Lars Birkedal,
John C. Reynolds:
Local reasoning about a copying garbage collector.
ACM Trans. Program. Lang. Syst. 30(4): (2008) |
| 32 | EE | John C. Reynolds:
Some thoughts on teaching programming and programming languages.
SIGPLAN Notices 43(11): 108-110 (2008) |
| 2005 |
|---|
| 31 | EE | John C. Reynolds:
An Overview of Separation Logic.
VSTTE 2005: 460-469 |
| 2004 |
|---|
| 30 | EE | John C. Reynolds:
Toward a Grainless Semantics for Shared-Variable Concurrency.
FSTTCS 2004: 35-48 |
| 29 | EE | Lars Birkedal,
Noah Torp-Smith,
John C. Reynolds:
Local reasoning about a copying garbage collector.
POPL 2004: 220-231 |
| 28 | EE | Peter W. O'Hearn,
Hongseok Yang,
John C. Reynolds:
Separation and information hiding.
POPL 2004: 268-280 |
| 2002 |
|---|
| 27 | EE | John C. Reynolds:
Separation Logic: A Logic for Shared Mutable Data Structures.
LICS 2002: 55-74 |
| 2001 |
|---|
| 26 | EE | Peter W. O'Hearn,
John C. Reynolds,
Hongseok Yang:
Local Reasoning about Programs that Alter Data Structures.
CSL 2001: 1-19 |
| 2000 |
|---|
| 25 | | John C. Reynolds:
An Intrinsic Semantics of Intersection Types.
ICALP Satellite Workshops 2000: 269-270 |
| 24 | EE | Peter W. O'Hearn,
John C. Reynolds:
From Algol to polymorphic linear lambda-calculus.
J. ACM 47(1): 167-223 (2000) |
| 1998 |
|---|
| 23 | | John C. Reynolds:
Definitional Interpreters Revisited.
Higher-Order and Symbolic Computation 11(4): 355-361 (1998) |
| 22 | | John C. Reynolds:
Definitional Interpreters for Higher-Order Programming Languages.
Higher-Order and Symbolic Computation 11(4): 363-397 (1998) |
| 1997 |
|---|
| 21 | | John C. Reynolds:
Beyond ML.
SIGPLAN Notices 32(1): 103-105 (1997) |
| 1996 |
|---|
| 20 | | John C. Reynolds:
Beyond ML.
ACM Comput. Surv. 28(4es): 172 (1996) |
| 1995 |
|---|
| 19 | | John C. Reynolds:
Using Functor Categories to Generate Intermediate Code.
POPL 1995: 25-36 |
| 1993 |
|---|
| 18 | | John C. Reynolds:
An Introduction to Logical Relations and Parametric Polymorphism - Tutorial.
POPL 1993: 155-156 |
| 17 | | John C. Reynolds,
Gordon D. Plotkin:
On Functors Expressible in the Polymorphic Typed Lambda Calculus
Inf. Comput. 105(1): 1-29 (1993) |
| 16 | | John C. Reynolds:
The Discoveries of Continuations.
Lisp and Symbolic Computation 6(3-4): 233-248 (1993) |
| 1991 |
|---|
| 15 | | QingMing Ma,
John C. Reynolds:
Types, Abstractions, and Parametric Polymorphism, Part 2.
MFPS 1991: 1-40 |
| 14 | | John C. Reynolds:
The Coherence of Languages with Intersection Types.
TACS 1991: 675-700 |
| 1989 |
|---|
| 13 | | John C. Reynolds:
Syntactic Control of Inference, Part 2.
ICALP 1989: 704-722 |
| 1985 |
|---|
| 12 | | John C. Reynolds:
Three Approaches to Type Structure.
TAPSOFT, Vol.1 1985: 97-138 |
| 1984 |
|---|
| 11 | | John C. Reynolds:
Polymorphism is not Set-Theoretic.
Semantics of Data Types 1984: 145-156 |
| 1983 |
|---|
| 10 | | John C. Reynolds:
Types, Abstraction and Parametric Polymorphism.
IFIP Congress 1983: 513-523 |
| 9 | | John C. Reynolds:
An Introduction to Specification Logic.
Logic of Programs 1983: 442 |
| 1980 |
|---|
| 8 | | John C. Reynolds:
Using category theory to design implicit conversions and generic operators.
Semantics-Directed Compiler Generation 1980: 211-258 |
| 1979 |
|---|
| 7 | | John C. Reynolds:
Reasoning About Arrays.
Commun. ACM 22(5): 290-299 (1979) |
| 1978 |
|---|
| 6 | | John C. Reynolds:
Syntactic Control of Interference.
POPL 1978: 39-46 |
| 1977 |
|---|
| 5 | EE | John C. Reynolds:
Semantics of the Domain of Flow Diagrams.
J. ACM 24(3): 484-503 (1977) |
| 1974 |
|---|
| 4 | | John C. Reynolds:
On the Relation between Direct and Continuation Semantics.
ICALP 1974: 141-156 |
| 3 | | John C. Reynolds:
Towards a theory of type structure.
Symposium on Programming 1974: 408-423 |
| 1968 |
|---|
| 2 | | John C. Reynolds:
Automatic computation of data set definitions.
IFIP Congress (1) 1968: 456-461 |
| 1 | | John C. Reynolds:
A generalized resolution principle based upon context-free grammars.
IFIP Congress (2) 1968: 1405-1411 |
