메뉴 건너뛰기




Volumn 260, Issue 1-2, 2001, Pages 87-117

On the structure of categories of coalgebras

Author keywords

Classifier; Coalgebra; Cofree comonad; Subobject; Topos; Weak pullback

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES;

EID: 0034920651     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00124-9     Document Type: Article
Times cited : (41)

References (40)
  • 10
    • 84951044449 scopus 로고    scopus 로고
    • Bisimulation for probabilistic transition systems: A coalgebraic approach
    • to appear; extended abstract in Proc. ICALP '97, Lecture Notes in Computer Science, Springer, Berlin
    • (1997) Theoret. Comput. Sci. , vol.1256 , pp. 460-470
    • De Vink, E.1    Rutten, J.J.M.M.2
  • 19
    • 84971195724 scopus 로고
    • A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
    • (1980) Bull. Austral. Math. Soc. , vol.22 , pp. 1-83
    • Kelly, G.M.1
  • 23


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.