Volume 33, 2000
CMCS'2000 Coalgebraic Methods in Computer Science
Berlin, Germany, 25-26 March 2000
- Horst Reichel:
Preface.
1-2
- Ola Angelsmark:
Constraints, Adjunctions and (Co)algebras.
3-12
- Michael Baldamus:
Compositional Constructor Interpretation over Coalgebraic Models for the pi-Calculus.
13-41
- Alexandru Baltag:
A Logic for Coalgebraic Simulation.
42-60
- Samuel R. Buss, Grigore Rosu:
Incompleteness of Behavioral Logics.
61-79
- Corina Cîrstea:
An Algebra-Coalgebra Framework for System Specification.
80-110
- H. Peter Gumm, Tobias Schröder:
Coalgebraic structure from weak limit preserving functors.
111-131
- Furio Honsell, Marina Lenisa:
Coalgebraic Coinduction in (Hyper)set-theoretic Categories.
132-159
- Bart Jacobs:
Towards a Duality Result in Coalgebraic Modal Logic.
160-195
- Alexander Kurz, Dirk Pattinson:
Notes on Coalgebras, Cofibrations and Concurrency.
196-229
- Marina Lenisa, John Power, Hiroshi Watanabe:
Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads.
230-260
- Luís Monteiro:
Observation systems.
261-275
- Erik Poll:
A Coalgebraic Semantics of Subtyping.
276-293
- Martin Rößiger:
Coalgebras and Modal Logic.
294-315
- Hendrik Tews:
Coalgebras for Binary Methods.
316
- Uwe Wolter:
On Corelations, Cokernels, and Coequations.
317-336
- James Worrell:
Coinduction for recursive data types: partial orders, metric spaces and Omega-categories.
337-356
Last update Mon May 20 17:05:04 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
