default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st CALCO 2005: Swansea, Wales, UK
- José Luiz Fiadeiro, Neil Harman, Markus Roggenbach
, Jan J. M. M. Rutten:
Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings. Lecture Notes in Computer Science 3629, Springer 2005, ISBN 3-540-28620-9 - Samson Abramsky:
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories. 1-29 - Bartek Klin, Vladimiro Sassone, Pawel Sobocinski:
Labels from Reductions: Towards a General Theory. 30-50 - Gordon D. Plotkin:
Adequacy for Algebraic Effects with State. 51-51 - Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt. 52-66 - Jirí Adámek:
Algebra 'cap' Coalgebra = Presheaves. 67-82 - Jan A. Bergstra, Cornelis A. Middelburg:
Strong Splitting Bisimulation Equivalence. 83-97 - Roberto Bruni, Ivan Lanese, Ugo Montanari:
Complete Axioms for Stateless Connectors. 98-113 - Federico De Marchi:
On the Semantics of Coinductive Types in Martin-Löf Type Theory. 114-126 - Ernst-Erich Doberkat:
Look: Simple Stochastic Relations Are Just, Well, Simple. 127-141 - Gian-Luigi Ferrari, Ugo Montanari, Emilio Tuosto, Björn Victor, Kidane Yemane:
Modelling Fusion Calculus using HD-Automata. 142-156 - Anthony C. J. Fox:
An Algebraic Framework for Verifying the Correctness of Hardware with Input and Output: A Formalization in HOL. 157-174 - Clemens Grabmayer:
Using Proofs by Coinduction to Find "Traditional" Proofs. 175-193 - H. Peter Gumm:
From T-Coalgebras to Filter Structures and Transition Systems. 194-212 - Ichiro Hasuo, Bart Jacobs:
Context-Free Languages via Coalgebraic Trace Semantics. 213-231 - Daniel Hausmann, Till Mossakowski, Lutz Schröder:
Towards a Coalgebraic Semantics of the Ambient Calculus. 232-246 - Bartek Klin:
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic. 247-262 - Clemens Kupke, Alexander Kurz, Dirk Pattinson:
Ultrafilter Extensions for Coalgebras. 263-277 - John G. Mersch:
Equational Logic of Recursive Program Schemes. 278-292 - Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. 293-312 - Miguel Palomino, José Meseguer, Narciso Martí-Oliet:
A Categorical Approach to Simulations. 313-330 - Andrei Popescu, Grigore Rosu:
Behavioral Extensions of Institutions. 331-347 - John Power:
Discrete Lawvere Theories. 348-363 - César Sánchez, Henny B. Sipma, Matteo Slanina, Zohar Manna:
Final Semantics for Event-Pattern Reactive Programs. 364-378 - Prasanna Thati, José Meseguer:
Complete Symbolic Reachability Analysis Using Back-and-Forth Narrowing. 379-394 - Ignacio D. Viglizzo:
Final Sequences and Final Coalgebras for Measurable Spaces. 395-407 - Michal Walicki:
Bireachability and Final Multialgebras. 408-423 - Dennis Walter, Lutz Schröder, Till Mossakowski:
Parametrized Exceptions. 424-438 - Artur Zawlocki, Grzegorz Marczynski, Piotr Kosiuczenko:
Property Preserving Redesign of Specifications. 439-455
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.
last updated on 2026-08-29 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and RhinelandâPalatinate.
