Category Theoretic Models of Data Refinement

Michael Johnson*, David Naumann, John Power

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We give an account of the use of category theory in modelling data refinement over the past twenty years. We start with Tony Hoare's formulation of data refinement in category theoretic terms, explain how the category theory may be made precise in generality and with elegance, using the notion of structure respecting lax transformation, for a first order imperative language, then study two main alternatives for extending that category theoretic analysis in order to account for higher order languages. The first is given by adjoint simulations; the second is given by the notion of lax logical relation. These provide techniques that can be used for a combined language, such as an imperative language with procedure passing.

Original languageEnglish
Pages (from-to)21-38
Number of pages18
JournalElectronic Notes in Theoretical Computer Science
Volume225
Issue numberC
DOIs
Publication statusPublished - 2 Jan 2009

Fingerprint

Dive into the research topics of 'Category Theoretic Models of Data Refinement'. Together they form a unique fingerprint.

Cite this