Skip to main content
SpringerLink
Log in

Algebra and Coalgebra in Computer Science

First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. José Luiz Fiadeiro

    1. Department of Computer Science, University of Leicester, Leicester, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Neil Harman

    1. Department of Computer Science, University of Wales Swansea, Swansea, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Markus Roggenbach

    1. University of Wales Swansea, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Jan Rutten

    1. CWI and Vrije Universiteit Amsterdam,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: CALCO 2005.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Keywords

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories

      • Samson Abramsky
      Pages 1-29

    2. Labels from Reductions: Towards a General Theory

      • Bartek Klin, Vladimiro Sassone, Paweł Sobociński
      Pages 30-50

    3. Adequacy for Algebraic Effects with State

      • Gordon Plotkin
      Pages 51-51

  3. Contributed Papers

    1. Bisimilarity Is Not Finitely Based over BPA with Interrupt

      • Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Sumit Nain
      Pages 52-66

    2. Algebra ∩ Coalgebra = Presheaves

      • J. Adámek
      Pages 67-82

    3. Strong Splitting Bisimulation Equivalence

      • J. A. Bergstra, C. A. Middelburg
      Pages 83-97

    4. Complete Axioms for Stateless Connectors

      • Roberto Bruni, Ivan Lanese, Ugo Montanari
      Pages 98-113

    5. On the Semantics of Coinductive Types in Martin-Löf Type Theory

      • Federico De Marchi
      Pages 114-126

    6. Look: Simple Stochastic Relations Are Just, Well, Simple

      • Ernst-Erich Doberkat
      Pages 127-141

    7. Modelling Fusion Calculus using HD-Automata

      • Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Björn Victor, Kidane Yemane
      Pages 142-156

    8. An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL

      • Anthony Fox
      Pages 157-174

    9. Using Proofs by Coinduction to Find “Traditional” Proofs

      • Clemens Grabmayer
      Pages 175-193

    10. From T-Coalgebras to Filter Structures and Transition Systems

      • H. Peter Gumm
      Pages 194-212

    11. Context-Free Languages via Coalgebraic Trace Semantics

      • Ichiro Hasuo, Bart Jacobs
      Pages 213-231

    12. Towards a Coalgebraic Semantics of the Ambient Calculus

      • Daniel Hausmann, Till Mossakowski, Lutz Schröder
      Pages 232-246

    13. The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic

      • Bartek Klin
      Pages 247-262

    14. Ultrafilter Extensions for Coalgebras

      • C. Kupke, A. Kurz, D. Pattinson
      Pages 263-277

    15. Equational Logic of Recursive Program Schemes

      • John G. Mersch
      Pages 278-292

    16. The Category Theoretic Solution of Recursive Program Schemes

      • Stefan Milius, Lawrence S. Moss
      Pages 293-312
Back to top

Other volumes

  1. Algebra and Coalgebra in Computer Science

Editors and Affiliations

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

    José Luiz Fiadeiro

  • Department of Computer Science, University of Wales Swansea, Swansea, UK

    Neil Harman

  • University of Wales Swansea, United Kingdom

    Markus Roggenbach

  • CWI and Vrije Universiteit Amsterdam,  

    Jan Rutten

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation