Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=280
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
CSP, partial automata, and coalgebras
Uwe Wolter
Theoretical Computer Science
280
(3), 2002, pp. 3-34
A coalgebraic equational approach to specifying observational structures
Corina Cîrstea
Theoretical Computer Science
280
(1-2), 2002, pp. 35-68
On institutions for modular coalgebraic specifications
Alexander Kurz
,
Rolf Hennicker
Theoretical Computer Science
280
(1-2), 2002, pp. 69-103
The continuum as a final coalgebra
D. Pavlović
,
V. Pratt
Theoretical Computer Science
280
(1-2), 2002, pp. 105-122
Coalgebra morphisms subsume open maps
Sƚawomir Lasota
Theoretical Computer Science
280
(1-2), 2002, pp. 123-135
Combining a monad and a comonad
John Power
,
Hiroshi Watanabe
Theoretical Computer Science
280
(1-2), 2002, pp. 137-162
Compositional SOS and beyond: A coalgebraic view of open systems
Andrea Corradini
,
Reiko Heckel
,
Ugo Montanari
Theoretical Computer Science
280
(1-2), 2002, pp. 163-192