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=260
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semantic constructions for the specification of objects
Corina Cîrstea
Theoretical Computer Science
260
(1-2), 2001, pp. 3-25
A coalgebraic presentation of structured transition systems
Andrea Corradini
,
Martin Gross̈e-Rhode
,
Reiko Heckel
Theoretical Computer Science
260
(1-2), 2001, pp. 27-55
Equational and implicational classes of coalgebras
H. Peter Gumm
Theoretical Computer Science
260
(1-2), 2001, pp. 57-69
Covarieties and complete covarieties
H. Peter Gumm
,
Tobias Schröder
Theoretical Computer Science
260
(1-2), 2001, pp. 71-86
On the structure of categories of coalgebras
Peter Johnstone
,
John Power
,
Toru Tsujishita
,
Hiroshi Watanabe
,
James Worrell
Theoretical Computer Science
260
(1-2), 2001, pp. 87-117
Specifying coalgebras with modal logic
Alexander Kurz
Theoretical Computer Science
260
(1-2), 2001, pp. 119-138
Parametric corecursion
Lawrence S. Moss
Theoretical Computer Science
260
(1-2), 2001, pp. 139-163
Fusion of recursive programs with computational effects
Alberto Pardo
Theoretical Computer Science
260
(1-2), 2001, pp. 165-207
From modal logic to terminal coalgebras
Martin Röss̈iger
Theoretical Computer Science
260
(1-2), 2001, pp. 209-228
Equational axiomatizability for coalgebra
Grigore Roşu
Theoretical Computer Science
260
(1-2), 2001, pp. 229-247