Theoretical Computer Science logo Elsevier logo

Publisher: Elsevier

Volume 260, Number 1, 6 June 2001
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

Foreword
pp. 1-1(1)
Authors: Jacobs B.; Moss L.; Reichel H.; Rutten J.

Semantic constructions for the specification of objects
pp. 3-25(23)
Author: Crstea1 C.

A Coalgebraic presentation of structured transition systems
pp. 27-55(29)
Authors: Corradini A.; Grosze-Rhode M.; Heckel R.

Equational and implicational classes of coalgebras
pp. 57-69(13)
Author: Gumm H.P.

Covarieties and complete covarieties
pp. 71-86(16)
Authors: Gumm H.P.; Schroder T.

On the structure of categories of coalgebras
pp. 87-117(31)
Authors: Johnstone P.; Power J.; Tsujishita T.; Watanabe H.; Worrell J.

Specifying coalgebras with modal logic
pp. 119-138(20)
Author: Kurz A.

Parametric corecursion
pp. 139-163(25)
Author: Moss L.S.

Fusion of recursive programs with computational effects
pp. 165-207(43)
Author: Pardo A.

From modal logic to terminal coalgebras
pp. 209-228(20)
Author: Ro M.

Equational axiomatizability for coalgebra
pp. 229-247(19)
Author: Rosu1 G.

Author index volume 260 (2001)
pp. 249-249(1)

Master index volumes 251-260
pp. 251-259(9)

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A