1998
DOI: 10.1017/s0960129598002588
|View full text |Cite
|
Sign up to set email alerts
|

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

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 phen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
28
0

Year Published

2000
2000
2009
2009

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 83 publications
(29 citation statements)
references
References 44 publications
1
28
0
Order By: Relevance
“…For this reason, they have been used in the theory of concurrency and specification, as well as in the study of semantics for programming languages with coinductive types [10,11,18,29,4].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For this reason, they have been used in the theory of concurrency and specification, as well as in the study of semantics for programming languages with coinductive types [10,11,18,29,4].…”
Section: Introductionmentioning
confidence: 99%
“…Those of finite length form the corresponding W-type. More examples of importance in computer science can be found in [18] and [29]. But there are examples that are not toposes.…”
Section: Introductionmentioning
confidence: 99%
“…Being final means that there exists a unique morphism to out T from each other coalgebra U, p . This is called the coinductive extension of p [48] or the anamorphism generated by p [28], and written as [(p)] T or, simply, [(p)], if the functor is clear from context. In other words, an anamorphism is defined as the unique function making the following diagram to commute:…”
Section: Component's Behaviour and Bisimulationmentioning
confidence: 99%
“…categories where objects are sets (classes) of a possible non-wellfounded universe and morphisms are set (class) functions, have been used as convenient settings for studying the foundations of coalgebraic semantics, see e.g. [1,2,7,8,10,18,15,12,3,4].…”
Section: Introductionmentioning
confidence: 99%