Generalised coinduction (Q4408808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1941748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalised coinduction |
scientific article; zbMATH DE number 1941748 |
Statements
Generalised coinduction (English)
0 references
27 November 2003
0 references
coalgebra
0 references
coinduction
0 references
computer system models
0 references
bisimulation
0 references
proof schemata
0 references
0.8332583904266357
0 references
0.8252260088920593
0 references
0.8236513733863831
0 references
The notion of an \(F\)-coalgebra for a functor \(F\) on some category \(\mathcal C\) has been used to formally model dynamical systems in computer science. These include processes, automata, datatypes such as infinite streams or trees of unbounded depth. The instance of the functor \(F\) determines the type of behaviour under consideration. This uniform description has allowed for an abstract formulation of definitions and proof principles that had been studied separately for various applications before. For instance, definitions of bisimilarity proposed for numerous types of systems have been shown to be instances of an abstract notion of bisimilarity defined in terms of \(F\)-bisimulation. A final \(F\)-coalgebra, if it exists, provides a canonical domain for behaviours of the type \(F\). The term coinduction is used for the definition and proof techniques for such a system, and the coinduction proof principle is the technique that uses \(F\)-bisimulation to prove equality among the states of a final \(F\)-coalgebra. The aim of the present paper is to give a broader categorical account of extended coinduction principles which have been proposed. This is done by introducing a parameterized framework that can be instantiated to yield several coinductive definitions and proof schemata.
0 references