Objects, interference and the Yoneda embedding

@inproceedings{OHearn1995ObjectsIA,
  title={Objects, interference and the Yoneda embedding},
  author={Peter W. O'Hearn and Uday S. Reddy},
  booktitle={MFPS},
  year={1995}
}

An Automata-Theoretic Model of Idealized Algol - (Extended Abstract)

A new model of class-based Algol-like programming languages inspired by automata-theoretic concepts that is able to combine both the state-based and event-based views of objects.

An Automata-Theoretic Model of Objects

A new model of classbased Algol-like programming languages inspired by automa tatheoretic concepts, which is able to combine both the state-based and event-based views of objects and illustrates the efficacy of the model by proving several test equivalences.

An Automata-Theoretic Model of Idealized Algol

A new model of class-based Algollike programming languages inspired by automata-theoretic concepts that is able to combine both the state-based and event-based views of objects.

Automata-Theoretic Semantics of Idealized Algol with Passive Expressions

Objects and Classes in Algol-Like Languages

  • U. Reddy
  • Computer Science
    Inf. Comput.
  • 2002
It is shown that the basic framework of this theory extends cleanly and elegantly to the concepts of objects and classes, and a clear correspondence emerges between classes and abstract data types, whose theory corresponds to that of existential types.

From Algol to polymorphic linear lambda-calculus

This work translates two variations on Algol 60 into a purely functional language with polymorphic linear types, and demonstrates that a linearly-typed functional language can be at least as expressive as AlGol.

Parametricity and local variables

This work uses relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria, and supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics.

The regular-language semantics of second-order idealized ALGOL

Global state considered unnecessary: An introduction to object-based semantics

  • U. Reddy
  • Computer Science
    LISP Symb. Comput.
  • 1996
A novel approach based on a notion of objects to characterize them in terms of their observable behavior and it is shown that this leads to considerable accuracy in the semantic modelling of locality and single-threadedness properties of objects.

References

SHOWING 1-10 OF 40 REFERENCES

A category-theoretic approach to the semantics of programming languages

A framework for handling the semantics of fully typed programming languages with imperative features, higher-order ALGOL-like procedures, block structure, and implicit conversions is created and certain functor categories are Cartesian closed and to describe a category (SIGMA) of store shapes.

Functor - Category Semantics of Programming Languages and Logics

This paper is an introduction to the Reynolds-Oles technique and its applications and a novel feature of the presentation is the systematic use in functor categories of analogues to conventional domain constructions.

Fully Abstract Semantics for Observably Sequential Languages

This paper focuses on a sequential extension of PCF that includes two classes of control operators: a possibly empty set of error generators and a collection of catch and throw constructs, and presents a fully abstract semantics for SPCF.

A model for syntactic control of interference

  • P. O'Hearn
  • Computer Science
    Mathematical Structures in Computer Science
  • 1993
Reynolds' concept of passive type - i.e. types for phrases that do not write to any storage variables - is shown to be closely related, in this model, to Girard's ‘of course’ modality.

Categorical models for local names

  • I. Stark
  • Computer Science
    LISP Symb. Comput.
  • 1996
This paper describes the construction of categorical models for thenu-calculus, a language that combines higher-order functions with dynamically creatednames, and how these provide a sound denotational semantics for the nu-Calculus and can be used to reason about observable equivalence in the language.

On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (Preliminary Report)

The research reported in this paper is concerned with the problem of reasoning about properties of higher order functions involving state, and develops a general, categorical framework for computationally adequate models of the language based on Moggi’s monadic approach to denotational semantics.

Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?

A notion of ‘logical relation’ is introduced which incorporates a version of representation independence for local names and is shown to be complete (and decidable) for expressions of first order types, but incomplete at higher types.

Algebraic Methods in Semantics

This book, which contains contributions from leading researchers in France, USA and Great Britain, gives detailed accounts of a variety of methods for describing the semantics of programming

Parametricity and local variables

This work uses relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria, and supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics.

Passivity and independence

  • U. Reddy
  • Computer Science
    Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
  • 1994
A semantic model is defined which captures the notions of "change", "absence of change" and "independent change" etc by extending the author's "linear logic model of state" with dependence/independence relations so that sequential traces give way to pomset traces.