A Calculus of Terms for Coalgebras of Polynomial Functors-Reference-Cited by-同舟云学术

A Calculus of Terms for Coalgebras of Polynomial Functors

Published:2001-05 Issue:1 Volume:44 Page:161-184
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Goldblatt Robert

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Aczel P. and N. Mendler, A Final Coalgebra Theorem, in: D. H. Pitt et al., editors, Category Theory and Computer Science. Proceedings 1989, Lecture Notes in Computer Science 389, Springer-Verlag, 1989 pp. 357–365.

2. “Models and Ultraproducts,”;Bell,1969

3. “Model Theory,”;Chang,1973

4. Goldblatt R., What is the Coalgebraic Analogue of Birkhoff's Variety Theorem?, Theoretical Computer Science, to appear. Manuscript available at http://www.mcs.vuw.ac.nz/~rob/papers/what.ps.

5. Hermida C., “Fibrations, Logical Predicates and Indeterminates,” Ph.D. thesis, University of Edinburgh (1993), techn. rep. LFCS-93-277. Also available as Aarhus Univ. DAIMI Techn. rep. PB-462.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bisimulation proof methods in a path-based specification language for polynomial coalgebras;Mathematical Structures in Computer Science;2014-11-10

2. Translating Logics for Coalgebras;Recent Trends in Algebraic Development Techniques;2003

3. A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras;Electronic Notes in Theoretical Computer Science;2002-10

4. Logics Admitting Final Semantics;Lecture Notes in Computer Science;2002