Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T04:32:09.760Z Has data issue: false hasContentIssue false
  • English
  • Français

Order-enrichment for categories of partial maps

Published online by Cambridge University Press:  04 March 2009

Marcelo P. Fiore
Marcelo P. Fiore
Affiliation:
Department of Computer Science, Laboratory for Foundations of Computer Science, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, Scotland. Email [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Motivated by a desire to treat non-termination directly in the semantics of computation, the notion of approximation between programs is studied in the context of categories of partial maps. In particular, contextual approximation and specialisation are considered and shown to coincide. Moreover, after exhibiting the approximation between total maps as a primitive notion, from an arbitrary (or axiomatic) approximation order on total maps a computationally natural approximation order on partial maps is derived. The main technical contribution is a characterisation of when this approximation order between partial maps is domain-theoretic (in the sense that the category of partial maps Cpo-enriches) provided that the approximation order between total maps is also.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 5 , Issue 4 , December 1995 , pp. 533 - 562
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Fiore, M. P. (1994) Axiomatic Domain Theory in Categories of Partial Maps, PhD thesis, University of Edinburgh. Technical report ECS-LFCS-94–307, Department of Computer Science. (To be published by Cambridge University Press in the Distinguished Dissertations Series.)Google Scholar
Fiore, M. P. and Plotkin, G.D. (1994) An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC. In: 9th LICS Conf, IEEE, Computer Society Press 92–102.Google Scholar
Freyd, P. J. and Kelly, G. M. (1972) Categories of continuous functors, I. Journal of Pure and Applied Algebra 2 169–191.CrossRefGoogle Scholar
Kelly, G. M. (1982) Basic Concepts of Enriched Category Theory, Cambridge University Press.Google Scholar
Longo, G. and Moggi, E. (1984) Cartesian Closed Categories of Enumerations for effective Type-Structures. In: Kahn, G., MacQueen, D. and Plotkin, G. (eds.) Symposium on Semantics of Data Types. Springer-Verlag Lecture Notes in Computer Science 173.Google Scholar
Moggi, E. (1986) Categories of Partial Morphisms and the partial lambda-calculus. In: Proceedings Workshop on Category Theory and Computer Programming, Guildford 1985. Springer-Verlag Lecture Notes in Computer Science 240 242–251.CrossRefGoogle Scholar
Plotkin, G. D. (1985) Denotational Semantics with Partial Functions, Lecture at C.S.L.I. Summer School.Google Scholar
Robinson, E. and Rosolini, G. (1988) Categories of Partial Maps. Information and Computation 79 95–130.CrossRefGoogle Scholar
Rosolini, G. (1986) Continuity and Effectiveness in Topoi, PhD thesis, University of Oxford.Google Scholar
Smyth, M. B. (1992) Topology. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, volume 1, Oxford University Press 641–761.CrossRefGoogle Scholar
Zhang, G.-Q. (1991) Logic of Domains, Birkhäuser.CrossRefGoogle Scholar