Categories of processes enriched in final coalgebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2030, Issue , 2001, Pages 303-317

  Krstić, Sava ^a   Launchbury, John ^a   Pavlović, Duško ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b KESTREL INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SEMANTICS;

BISIMILARITY; COALGEBRAS; DENOTATIONAL SEMANTICS; ENRICHED CATEGORIES; FINAL COALGEBRAS; FUNCTORS; HYPERFUNCTIONS;

COMPUTATION THEORY;

EID: 33748875566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_20     Document Type: Conference Paper

References (20)

1. S. Abramsky. Interaction categories. In Theory and Formal Methods '93, Workshops in Computer Science, pages 57-70. Springer-Verlag, 1996.
2. S. Abramsky. Retracing some paths in process algebra. In U. Montanari and V. Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference, volume 1119 of Lecture Notes in Computer Science, pages 1-17, 1996.
3. P. Aczel. Non-Well-Founded Sets. CSLI Publications, 1988.
4. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3. Clarendon Press, 1994.
5. M. A. Arbib and E. G. Manes.: Machines in a category: An expository introduction. SIAM Review, 16:163-192, 1974.
6. M. A. Arbib. A common framework for automata theory - a rapprochement. Automatica, 3:161-189, 1966.
7. E. Bainbridge, P.J. Freyd, A. Scedrov, and P. Scott. Functorial polymor- phism. Theoretical Computer Science, 70:35-64, 1990.
8. S. Brookes and S. Geva. Computational comonads and intensional semantics. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Categories in Computer Science, pages 1-44. Cambridge University Press, 1992.
9. J. W. Gray. Formal Category Theory: Adjointness for 2-categories. Springer, 1974.
10. M. Hyland. A small complete category. Annals of Pure and Applied Logic, 40:135-165, 1988.
11. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222-259, 1997.
12. G. M. Kelly. Basic Concepts of Enriched Category Theory. Cambridge University Press, 1982.
13. J. Launchbury, S. Krstic, and T. E. Sauerwein. Zip fusion with hyperfunc- tions. Technical report, Oregon Graduate Institute, 2000. Preprint available on http://www.cse.ogi.edu/~krstic.
14. G. Longo and E. Moggi. onstructive natural deduction and its omega-set' interpretation. Mathematical Structures in Computer Science, 1:215-254, 1991.
15. E. Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
16. P. S. Mulry. Categorical fixed-point semantics. Theoretical Computer Science, 118:301-314, 199.
17. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249:3-80, 1996.
18. A. Simpson. A characterization of the least-fixed-point operator by dinaturality. Theoretical Computer Science, 118:301-314, 1993.
19. A. Simpson and G. Plotkin. Complete axioms for categorical fixed-point operators. In 15th Symposium on Logic in Computer Science (LICS 2000). IEEE Computer Society, 2000.
20. D. Turi and J. J. M. M. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8:481-540, 1998.