Skip to main content
  • Conference proceedings
  • © 2009

Algebra and Coalgebra in Computer Science

Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5728)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CALCO: International Conference on Algebra and Coalgebra in Computer Science

Conference proceedings info: CALCO 2009.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (32 papers)

  1. Front Matter

  2. Algebraic Effects and Recursive Equations

    1. Algebras for Parameterised Monads

      • Robert Atkey
      Pages 3-17
    2. Kleene Monads: Handling Iteration in a Framework of Generic Effects

      • Sergey Goncharov, Lutz Schröder, Till Mossakowski
      Pages 18-33
    3. Complete Iterativity for Algebras with Effects

      • Stefan Milius, Thorsten Palm, Daniel Schwencke
      Pages 34-48
    4. Semantics of Higher-Order Recursion Schemes

      • Jiří Adámek, Stefan Milius, Jiří Velebil
      Pages 49-63
  3. Theory of Coalgebra

    1. Coalgebraic Components in a Many-Sorted Microcosm

      • Ichiro Hasuo, Chris Heunen, Bart Jacobs, Ana Sokolova
      Pages 64-80
    2. Complementation of Coalgebra Automata

      • Christian Kissig, Yde Venema
      Pages 81-96
    3. Characterising Behavioural Equivalence: Three Sides of One Coin

      • Clemens Kupke, Raul Andres Leal
      Pages 97-112
  4. Bisimulation

    1. Approximating Labelled Markov Processes Again!

      • Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
      Pages 145-156
    2. Weak Bisimilarity Coalgebraically

      • Andrei Popescu
      Pages 157-172
    3. Coalgebraic Symbolic Semantics

      • Filippo Bonchi, Ugo Montanari
      Pages 173-190
    4. Traces, Executions and Schedulers, Coalgebraically

      • Bart Jacobs, Ana Sokolova
      Pages 206-220
    5. Non-strongly Stable Orders Also Define Interesting Simulation Relations

      • Ignacio Fábregas, David de Frutos Escrig, Miguel Palomino
      Pages 221-235
  5. Stone Duality

    1. Free Heyting Algebras: Revisited

      • Nick Bezhanishvili, Mai Gehrke
      Pages 251-266
    2. Distributive Lattice-Structured Ontologies

      • Hans Bruun, Dion Coumans, Mai Gehrke
      Pages 267-283

Other Volumes

  1. Algebra and Coalgebra in Computer Science

Keywords

  • Bisimulation
  • C* algebras
  • automata
  • coalgebra automata
  • coinduction
  • convay games
  • distributive ontologies
  • formal methods
  • game theory
  • grammars
  • heyting algebras
  • modeling
  • semantics
  • stone duality
  • verification

Editors and Affiliations

  • Department of Computer Science, University of Leicester, Leicester, UK

    Alexander Kurz

  • Dipartimento di Matematica e Informatica, Università di Udine, Udine, Italy

    Marina Lenisa

  • Faculty of Mathematics, Informatics and Mechanics, Warsaw University, Warsaw, Poland

    Andrzej Tarlecki

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions