Components as processes: An exercise in coalgebraic modeling

IFIP Advances in Information and Communication Technology

Volumn 49 AICT, Issue , 2000, Pages 397-417

  Barbosa, L S ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

coalgebra; composition; Software component

Indexed keywords

ANALYSIS AND DESIGN; BEHAVIOURAL ASPECTS; BISIMILARITY; COALGEBRAIC; COALGEBRAS; COMPOSITION OPERATORS; ENDOFUNCTORS; MORPHISMS; SOFTWARE COMPONENT;

CHEMICAL ANALYSIS; INFORMATION TECHNOLOGY;

INTERFACE STATES;

EID: 84868299185     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35520-7_20     Document Type: Conference Paper

References (20)

1. P. Aczel and N. Mendler. A final coalgebra theorem. In D. Pitt, D. Rydeheard, P. Dybjer, A. Pitts, and A. Poigne, editors, Proc. Category Theory and Computer Science, pages 357-365. Springer Lect. Notes Comp. Sci. (389), 1988.
2. L. S. Barbosa. Prototyping processes. In M. C. Meo and M. Vilares Ferro, editors, Proc. of AGP'99 - Joint Conference on Declarative Programming, pages 513-527, L' Aquila, Italy, 6-9 September 1999.
3. L. S. Barbosa. Forthcoming thesis. DI, Universidade do Minho, 2000.
4. Robin Cockett and Tom Fukushima. About Charity. Yellow Series Report No. 92/480/18, Dep. Computer Science, University of Calgary, June 1992.
5. Robin Cockett and Dwight Spencer. Strong categorical datatypes I. In R. A. G. Seely, editor, Proceedings of Int. Summer Category Theory Meeting, Montreal, Quebec, 23-30 June 1991, pages 141-169. AMS, CMS Conf. Proceedings 13, 1992.
6. C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Information & Computation, (145):105-121, 1998.
7. C. A. R Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall International, 1985.
8. B. Jacobs. Objects and classes, co-algebraically. In C. Lengauer B. Freitag, C.B. Jones and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83-103. Kluwer Acad. Publ., 1996.
9. B. Jacobs. The temporal logic of coalgebras via Galois algebras. Techn. rep. CSI-R9906, Comp. Sci. Inst., University of Nijmegen, 1999.
10. B. Jacobs. and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62:222-159, 1997.
11. Cliff B. Jones. Systematic Software Development Using VDM. Series in Computer Science. Prentice-Hall International, 1986.
12. A. J. R. G. Milner. Communication and Concurrency. Series in Computer Science. Prentice-Hall International, 1989.
13. A. Pardo. A calculational approach to strong datatypes. In Selected Papers from 8th Nordic Workshop on Programming Theory. Research Report 240, Oslo, 1996.
14. D. Park. Concurrency and automata on infinite sequences. pages 561-572. Springer Lect. Notes Comp. Sci. (154), 1981.
15. H. Reichel. An approach to object semantics based on terminal co-algebras. Math. Struc. Comp. Sci., (5):129-152, 1995.
16. J. Rutten. Universal coalgebra: A theory of systems. Technical Report CS-R9636, CWI, Amsterdam, 1996. (to appear in Theor. Comp. Sci.).
17. J. Rutten and D. Turi. Initial algebra and final co-algebra semantics for concurrency. In Proc. REX School: A Decade of Concurrency, pages 530-582. Springer Lect. Notes Comp. Sci. (803), 1994.
18. Dwight L. Spencer. Categorical Programming with Functorial Strength. PhD thesis, The Oregon Graduate Institute of Science and Technology, January 1993.
19. J. M. Spivey. The Z Notation: A Reference Manual. Series in Computer Science. Prentice-Hall International, 1989.
20. D. Turi and J. Rutten. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Math. Struc. Comp. Sci., 8(5):481-540, 1998.