John C. Reynolds

According to our database, John C. Reynolds authored at least 41 papers between 1965 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2012

Syntactic control of interference for separation logic.

Uday S. Reddy, John C. Reynolds

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011

Making Program Logics Intelligible.

John C. Reynolds

Proceedings of the 5th IEEE International Symposium on Theoretical Aspects of Software Engineering, 2011

2009

Separation and information hiding.

Peter W. O'Hearn, Hongseok Yang, John C. Reynolds

ACM Trans. Program. Lang. Syst., 2009

Using Category Theory to Design Programming Languages.

John C. Reynolds

Proceedings of the Programming Languages and Systems, 2009

2008

Local reasoning about a copying garbage collector.

Noah Torp-Smith, Lars Birkedal, John C. Reynolds

ACM Trans. Program. Lang. Syst., 2008

Some thoughts on teaching programming and programming languages.

John C. Reynolds

ACM SIGPLAN Notices, 2008

Readable Formal Proofs.

John C. Reynolds

Proceedings of the Verified Software: Theories, 2008

2005

An Overview of Separation Logic.

John C. Reynolds

Proceedings of the Verified Software: Theories, 2005

2004

Toward a Grainless Semantics for Shared-Variable Concurrency.

John C. Reynolds

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2002

Separation Logic: A Logic for Shared Mutable Data Structures.

John C. Reynolds

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

Local Reasoning about Programs that Alter Data Structures.

Peter W. O'Hearn, John C. Reynolds, Hongseok Yang

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

The design, definition and implementation of programming languages.

John C. Reynolds

ACM SIGSOFT Softw. Eng. Notes, 2000

From Algol to polymorphic linear lambda-calculus.

Peter W. O'Hearn, John C. Reynolds

J. ACM, 2000

An Intrinsic Semantics of Intersection Types.

John C. Reynolds

Proceedings of the ICALP Workshops 2000, 2000

1998

Definitional Interpreters for Higher-Order Programming Languages.

John C. Reynolds

High. Order Symb. Comput., 1998

Definitional Interpreters Revisited.

John C. Reynolds

High. Order Symb. Comput., 1998

Theories of programming languages.

John C. Reynolds

Cambridge University Press, ISBN: 978-0-521-59414-1, 1998

1996

Beyond ML.

John C. Reynolds

ACM Comput. Surv., 1996

1995

Using Functor Categories to Generate Intermediate Code.

John C. Reynolds

Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

1993

On Functors Expressible in the Polymorphic Typed Lambda Calculus

John C. Reynolds, Gordon D. Plotkin

Inf. Comput., July, 1993

The Discoveries of Continuations.

John C. Reynolds

LISP Symb. Comput., 1993

An Introduction to Logical Relations and Parametric Polymorphism - Tutorial.

John C. Reynolds

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1991

The Coherence of Languages with Intersection Types.

John C. Reynolds

Proceedings of the Theoretical Aspects of Computer Software, 1991

Types, Abstractions, and Parametric Polymorphism, Part 2.

QingMing Ma, John C. Reynolds

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1989

Syntactic Control of Inference, Part 2.

John C. Reynolds

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1987

Conjunctive Types and Algol-like Languages

John C. Reynolds

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1985

Three Approaches to Type Structure.

John C. Reynolds

Proceedings of the Mathematical Foundations of Software Development, 1985

1984

Polymorphism is not Set-Theoretic.

John C. Reynolds

Proceedings of the Semantics of Data Types, International Symposium, 1984

1983

An Introduction to Specification Logic.

John C. Reynolds

Proceedings of the Logics of Programs, 1983

Types, Abstraction and Parametric Polymorphism.

John C. Reynolds

Proceedings of the Information Processing 83, 1983

1981

The craft of programming.

John C. Reynolds

Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-188862-3, 1981

1980

Using category theory to design implicit conversions and generic operators.

John C. Reynolds

Proceedings of the Semantics-Directed Compiler Generation, 1980

1979

Reasoning About Arrays.

John C. Reynolds

Commun. ACM, 1979

1978

Syntactic Control of Interference.

John C. Reynolds

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1977

Semantics of the Domain of Flow Diagrams.

John C. Reynolds

J. ACM, 1977

1974

Towards a theory of type structure.

John C. Reynolds

Proceedings of the Programming Symposium, 1974

On the Relation between Direct and Continuation Semantics.

John C. Reynolds

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1970

GEDANKEN - a simple typeless language based on the principle of completeness and the reference concept.

John C. Reynolds

Commun. ACM, 1970

1968

A generalized resolution principle based upon context-free grammars.

John C. Reynolds

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 2, 1968

Automatic computation of data set definitions.

John C. Reynolds

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1965

Programming languages for non-numeric processing - 2: An introduction to the COGENT programming system.

John C. Reynolds

Proceedings of the 20th national conference, 1965