Hostname: page-component-745bb68f8f-f46jp Total loading time: 0 Render date: 2025-01-13T14:11:54.666Z Has data issue: false hasContentIssue false
  • English
  • Français

On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Published online by Cambridge University Press:  01 October 1998

DANIELE TURI  and
JAN RUTTEN
DANIELE TURI
Affiliation:
LFCS, University of Edinburgh, JCMB, The King's Buildings, Edinburgh EH9 3JZ, Scotland. Email: dt@dcs.ed.ac.uk
JAN RUTTEN
Affiliation:
CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands. Email: Jan.Rutten@cwi.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper, a revised version of Rutten and Turi (1993), is part of a programme aiming at formulating a mathematical theory of structural operational semantics to complement the established theory of domains and denotational semantics to form a coherent whole (Turi 1996; Turi and Plotkin 1997). The programme is based on a suitable interplay between the induction principle, which pervades modern mathematics, and a dual, non-standard ‘coinduction principle’, which underlies many of the recursive phenomena occurring in computer science.

The aim of the present survey is to show that the elementary categorical notion of a final coalgebra is a suitable foundation for such a coinduction principle. The properties of coalgebraic coinduction are studied both at an abstract categorical level and in some specific categories used in semantics, namely categories of non-well-founded sets, partial orders and metric spaces.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 8 , Issue 5 , October 1998 , pp. 481 - 540
Copyright
1998 Cambridge University Press

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.)