default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 280
Volume 280, Number 1-2, May 2002
- Bart Jacobs, Jan J. M. M. Rutten:
Coalgebraic Methods in Computer Science - Foreword. 1 - Uwe Wolter:
CSP, partial automata, and coalgebras. 3-34 - Corina Cîrstea:
A coalgebraic equational approach to specifying observational structures. 35-68 - Alexander Kurz
, Rolf Hennicker:
On institutions for modular coalgebraic specifications. 69-103 - Dusko Pavlovic, Vaughan R. Pratt:
The continuum as a final coalgebra. 105-122 - Slawomir Lasota:
Coalgebra morphisms subsume open maps. 123-135 - John Power, Hiroshi Watanabe:
Combining a monad and a comonad. 137-162 - Andrea Corradini, Reiko Heckel, Ugo Montanari:
Compositional SOS and beyond: a coalgebraic view of open systems. 163-192
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-09 11:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
