Technische Universit�t
Braunschweig
Institute f�r
Informatik
|
Zeit: |
11.05.02, 16.30 Uhr |
|
Ort: |
IZ, M�hlenpfordtstra�e 23, H�rsaal M 160 |
|
|
|
|
|
|
|
Vortragender: |
Prof. Dr. Horst Reichel, TU Dresden, |
|
|
Institut f�r Theoretische Informatik |
|
|
|
|
Thema: |
Why partial coalgebras? |
|
|
|
|
|
|
Zusammenfassung:
|
If
algebras and coalgebras are used to specify data types and process types, one
should have in mind that realizations of data types and process types should
be computable, i.e., expressible by means of recursively enumerable sets and
partial recursive functions. Taking computable processes into consideration
leads to partial coalgebras. Whereas partial algebras can be obtained from
total algebras by generalizations of the type functors, this is not possible
in case of coalgebras. In the talk we will present basic notions for partial
coalgebras and will present some intuitive examples. It turns out for
instance that partial observations can be used to represents fairness
properties. |
Die Dozenten der Informatik