Skip to main content
SpringerLink
Log in
Book cover

Algebra and Coalgebra in Computer Science

4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Andrea Corradini

    1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bartek Klin

    1. Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, Warszawa, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Corina Cîrstea

    1. School of Electronics and Computer Science, University of Southampton, Southampton, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

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

Included in the following conference series:

Conference proceedings info: CALCO 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. On the Statistical Thermodynamics of Reversible Communicating Processes

      • Giorgio Bacci, Vincent Danos, Ohad Kammar
      Pages 1-18

    2. Solving Fixed-Point Equations by Derivation Tree Analysis

      • Javier Esparza, Michael Luttenberger
      Pages 19-35

    3. Abstract Local Reasoning for Program Modules

      • Thomas Dinsdale-Young, Philippa Gardner, Mark Wheelhouse
      Pages 36-39

    4. Infinite Computation, Co-induction and Computational Logic

      • Gopal Gupta, Neda Saeedloei, Brian DeVries, Richard Min, Kyle Marple, Feliks Kluźniak
      Pages 40-54

  3. Contributed Papers

    1. From Corecursive Algebras to Corecursive Monads

      • Jiří Adámek, Mahdieh Haddadi, Stefan Milius
      Pages 55-69

    2. A Categorical Semantics for Inductive-Inductive Definitions

      • Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg, Anton Setzer
      Pages 70-84

    3. Finitary Functors: From Set to Preord and Poset

      • Adriana Balan, Alexander Kurz
      Pages 85-99

    4. Model Constructions for Moss’ Coalgebraic Logic

      • Jort Bergfeld, Yde Venema
      Pages 100-114

    5. Relation Liftings on Preorders and Posets

      • Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil
      Pages 115-129

    6. Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach

      • Corina Cîrstea
      Pages 130-144

    7. Refinement Trees: Calculi, Tools, and Applications

      • Mihai Codescu, Till Mossakowski
      Pages 145-160

    8. On the Fusion of Coalgebraic Logics

      • Fredrik Dahlqvist, Dirk Pattinson
      Pages 161-175

    9. Indexed Induction and Coinduction, Fibrationally

      • Clément Fumex, Neil Ghani, Patricia Johann
      Pages 176-191

    10. Stone Duality for Nominal Boolean Algebras with И

      • Murdoch J. Gabbay, Tadeusz Litak, Daniela Petrişan
      Pages 192-207

    11. A Counterexample to Tensorability of Effects

      • Sergey Goncharov, Lutz Schröder
      Pages 208-221

    12. The Microcosm Principle and Compositionality of GSOS-Based Component Calculi

      • Ichiro Hasuo
      Pages 222-236

    13. Bases as Coalgebras

      • Bart Jacobs
      Pages 237-252

    14. A Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata

      • Jun Kohjina, Toshimitsu Ushio, Yoshiki Kinoshita
      Pages 253-267

    15. Coalgebraic Semantics for Derivations in Logic Programming

      • Ekaterina Komendantskaya, John Power
      Pages 268-282
Back to top

Other volumes

  1. Algebra and Coalgebra in Computer Science

Keywords

About this book

This book constitutes the refereed proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2011, held in Winchester, UK, in August/September 2011. The 21 full papers presented together with 4 invited talks were carefully reviewed and selected from 41 submissions. The papers report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transfer of the resulting technologies into industrial practice. They cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, and system specification and verification. The book also includes 6 papers from the CALCO-tools Workshop, colocated with CALCO 2011 and dedicated to tools based on algebraic and/or coalgebraic principles.

Editors and Affiliations

  • Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Andrea Corradini

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

    Bartek Klin

  • School of Electronics and Computer Science, University of Southampton, Southampton, UK

    Corina Cîrstea

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation