default search action
2nd CMCS 1999: Amsterdam, The Netherlands
- Bart Jacobs, Jan J. M. M. Rutten:
Coalgebraic Methods in Computer Science, CMCS 1999, Amsterdam, The Netherlands, March 20-21, 1999. Electronic Notes in Theoretical Computer Science 19, Elsevier 1999 - Bart Jacobs, Jan J. M. M. Rutten:
Preface. 1 - Marina Lenisa:
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. 2-22 - Slawomir Lasota:
Coalgebra morphisms subsume open maps. 23 - James Worrell:
Terminal sequences for accessible endofunctors. 24-38 - Martin Rößiger:
Languages for Coalgebras on Datafunctors. 39-60 - Uwe Wolter:
A coalgebraic introduction to CSP. 61-80 - Peter Wegner, Dina Q. Goldin:
Coinductive Models of Finite Computing Agents. 81-101 - John Power, Hiroshi Watanabe:
Distributivity for a monad and a comonad. 102 - Dusko Pavlovic, Vaughan R. Pratt:
On coalgebra of real numbers. 103-117 - Andrea Corradini, Reiko Heckel, Ugo Montanari:
From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence. 118-141 - Corina Cîrstea:
A Coequational Approach to Specifying Behaviours. 142-163 - Rolf Hennicker, Alexander Kurz:
(Omega, Xi)-Logic: On the Algebraic Extension of Coalgebraic Specifications. 164-180 - Dorel Lucanu, Ovidiu Gheorghies, Adriana Apetrei:
Bisimulation and Hidden Algebra. 181-200 - Franck van Breugel, Stephen Watson:
A Note on Hyperspaces and Terminal Coalgebras. 201-208
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.