Samenvatting
Final coalgebras capture system behaviours such as streams, infinite trees and processes. Algebraic operations on a final coalgebra can be defined by distributive laws (of a syntax functor S over a behaviour functor F). Such distributive laws correspond to abstract specification formats. One such format is a generalisation of the GSOS rules known from structural operational semantics of processes. We show that given an abstract GSOS specification ¿ that defines operations s on a final F-coalgebra, we can systematically construct a GSOS specification ¿ that defines the pointwise extension s of s on a final FA-coalgebra. The construction relies on the addition of a family of auxiliary ‘buffer’ operations to the syntax. These buffer operations depend only on A, so the construction is uniform for all s and F.
| Originele taal-2 | Engels |
|---|---|
| Pagina's (van-tot) | 321-361 |
| Aantal pagina's | 41 |
| Tijdschrift | Mathematical Structures in Computer Science |
| Volume | 21 |
| Nummer van het tijdschrift | 2 |
| DOI's | |
| Status | Gepubliceerd - 2011 |
Vingerafdruk
Duik in de onderzoeksthema's van 'Pointwise extensions of GSOS-defined operations'. Samen vormen ze een unieke vingerafdruk.Citeer dit
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver