Electronic Notes in Theoretical Computer Science, Volume 19

Volume 19, 1999

• Bart Jacobs, Jan J. M. M. Rutten:
  Preface.
  
• Marina Lenisa:
  From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems.
  
• Slawomir Lasota:
  Coalgebra morphisms subsume open maps.
  
• James Worrell:
  Terminal sequences for accessible endofunctors.
  
• Martin Rößiger:
  Languages for Coalgebras on Datafunctors.
  
• Uwe Wolter:
  A coalgebraic introduction to CSP.
  
• Peter Wegner, Dina Q. Goldin:
  Coinductive Models of Finite Computing Agents.
  
• John Power, Hiroshi Watanabe:
  Distributivity for a monad and a comonad.
  
• Dusko Pavlovic, Vaughan R. Pratt:
  On coalgebra of real numbers.
  
• Andrea Corradini, Reiko Heckel, Ugo Montanari:
  From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence.
  
• Corina Cîrstea:
  A Coequational Approach to Specifying Behaviours.
  
• Rolf Hennicker, Alexander Kurz:
  (Omega, Xi)-Logic: On the Algebraic Extension of Coalgebraic Specifications.
  
• Dorel Lucanu, Ovidiu Gheorghies, Adriana Apetrei:
  Bisimulation and Hidden Algebra.
  
• Franck van Breugel, Stephen Watson:
  A Note on Hyperspaces and Terminal Coalgebras.