• Publications
  • Influence
Separation logic: a logic for shared mutable data structures
  • J. C. Reynolds
  • Computer Science
    Proceedings 17th Annual IEEE Symposium on Logic…
  • 22 July 2002
TLDR
An extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure is developed, including extensions that permit unrestricted address arithmetic, dynamically allocated arrays, and recursive procedures.
Types, Abstraction and Parametric Polymorphism
TLDR
The findings of a Web-based questionnaire aimed at discovering both patterns of use of videoconferencing systems within HP and the reasons people give for either not using, or for using such systems are discussed.
Definitional Interpreters for Higher-Order Programming Languages
TLDR
This work considers the definition of a simple applicative programming language by means of an interpreter written in a similar language, and considers the treatment of imperative features such as jumps and assignment.
Local Reasoning about Programs that Alter Data Structures
TLDR
An extension of Hoare's logic for reasoning about programs that alter data structures is described, based on a possible worlds model of the logic of bunched implications, and includes spatial conjunction and implication connectives alongside those of classical logic.
Towards a theory of type structure
7)(D) = B[w][71t]#D] and delta is a functor from Funct(C, C) into C. Even before defining the functors arrow and delta, it can be shown that B maps every type expression into a functor from C T into
The essence of ALGOL
TLDR
This paper enumerates the principles that it is believed embody the essence of Algol, describes a model that satisfies these principles, and illustrates this model with a language that, while more uniform and general, retains the character of AlGol.
Intuitionistic reasoning about shared mutable data structure
TLDR
This work extends Hoare's approach to proving the correctness of imperative programs, to deal with programs that perform destructive updates to data structures containing more than one pointer to the same location.
Syntactic control of interference
TLDR
This work shows how to eliminate difficulties by imposing syntactic restrictions, without prohibiting the kind of constructive interference which occurs with higher-order procedures or SIMULA classes, among components of collections named by single identifiers.
Using category theory to design implicit conversions and generic operators
  • J. C. Reynolds
  • Mathematics
    Semantics-Directed Compiler Generation
  • 14 January 1980
TLDR
A generalization of many-sorted algebras is defined and applied to the language-design problem of avoiding anomalies in the interaction of implicit conversions and generic operators.
On the Relation between Direct and Continuation Semantics
TLDR
This work gives two theorems which specify the relationship between the direct and the continuation semantic functions for a purely applicative language and shows that direct semantics are included in continuation semantics.
...
...