Mathematical Structures in Computer Science

Paper

Some reasons for generalising domain theory

MARTIN HYLANDa1

a1 Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, CMS, Wilberforce Road, Cambridge CB3 OWB, UK Email: m.hyland@dpmms.cam.ac.uk

Abstract

One natural way to generalise domain theory is to replace partially ordered sets by categories. This kind of generalisation has recently found application in the study of concurrency. An outline is given of the elegant mathematical foundations that have been developed. This is specialised to give a construction of cartesian closed categories of domains, which throws light on standard presentations of domain theory.

(Received March 16 2009)

(Revised October 09 2009)