State-based components made generic

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 39-56

  Barbosa, L S ^a   Oliveira, J N ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; LEARNING SYSTEMS; OBJECT ORIENTED PROGRAMMING;

BEHAVIORAL MODELS; COMPUTATIONAL STRUCTURES; SOFTWARE COMPONENTS; STATE-BASED SYSTEMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 18944365917     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80631-5     Document Type: Conference Paper

References (27)

1. Backhouse R.C., Jansson P., Jeuring J., Meertens L. Generic programming: An introduction. Swierstra S.D., Henriques P.R., Oliveira J.N. Third International Summer School on Advanced Functional Programming, Braga. Springer Lect. Notes Comp. Sci. 1608 :September 1998;28-115
2. Barbosa L.S. Components as processes: An exercise in coalgebraic modeling. Smith S.F., Talcott C.L. FMOODS'2000 - Formal Methods for Open Object-Oriented Distributed Systems. September 2000;397-417 Kluwer Academic Publishers
3. L. S. Barbosa. Components as Coalgebras. PhD thesis, DI, Universidade do Minho, 2001.
4. Barbosa L.S. Process calculi á la Bird-Meertens. CMCS'01 - Workshop on Coalgebraic Methods in Computer Science. ENTCS, volume 44.4 :April 2001;47-66 Elsevier, Genova
5. L. S. Barbosa and J. N. Oliveria. Coinductive interpreters for process calculi. In Proc. of FLOPS'02, pages 183-197, Aizu, Japan, September 2002. Springer Lect. Notes Comp. Sci. (2441).
6. Benabou J. Introduction to bicategories. Springer Lect. Notes Maths. 47:1967;1-77
7. Bird R., Moor O. The Algebra of Programming. Series in Computer Science :1997;Prentice-Hall International
8. Goguen J., Thatcher J., Wagner E. An initial algebra approach to the specification, correctness and implementation of abstract data types. Yeh R. Current Trends in Programming Methodology. 1978;80-149 Prentice-Hall International
9. Goguen J., Thatcher J., Wagner E., Wright J. Initial algebra semantics and continuous algebras. Jour. of the ACM. 24:(1):January 1977;68-95
10. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. EATCS Bulletin. 62:1997;159-222
11. P. Jansson and J. Jeuring. POLYP - a polytypic programming language extension. In POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 470-482. ACM Press, 1997.
12. Jeuring J., Jansson P. Polytypic programming. Launchbury T., Meijer E., Sheard T. International Summer School on Advanced Functional Programming. Springer Lect. Notes Comp. Sci. (1129) :1996;68-114
13. Jones Cliff B. Systematic Software Development Using VDM. Series in Computer Science :1986;Prentice-Hall International
14. Katis P., Sabadini N., Walters R.F.C. Bicategories of processes. Journal of Pure and Applied Algebra. 115:(2):1997;141-178
15. Katis P., Sabadini N., Walters R.F.C. On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo. II:(63):2000;123-156
16. Kelly G.M. Basic Concepts of Enriched Category Theory volume 64 of London Mathematical Society Lecture Notes Series. 1982;Cambridge University Press
17. Kock A. Strong functors and monoidal monads. Archiv für Mathematik. 23:1972;113-120
18. S. Krstic, J. Launchbury, and D. Pavlovic. Categories of processes enriched in final coalgebras. In Proceedings of FOSSACS, pages 303-317. Springer Lect. Notes Comp. Sci. (2030), 2001.
19. Mealy G.H. A method for synthesizing sequential circuits. Bell Systems Techn. Jour. 34:(5):1955;1045-1079
20. Milner R. Communication and Concurrency. Series in Computer Science :1989;Prentice-Hall International
21. J. N. Oliveira. Formal Software Development. Lecture Notes for the MSc in Computer Science, Minho University, 1992.
22. Reynolds J.C. Types, abstraction and parametric polymorphism. Information Processing. 83:1983;513-523
23. J. Rutten. Universal coalgebra: A theory of systems. Technical report, CWI, Amsterdam, 1996.
24. Rutten J. Universal coalgebra: A theory of systems. Theor. Comp. Sci. 249:(1):2000;3-80. (Revised version of CWI Techn. Rep. CS-R9652, 1996)
25. Spivey J.M. The Z Notation: A Reference Manual. Series in Computer Science (2nd ed) :1992;Prentice-Hall International
26. Szyperski C. Component Software, Beyond Object-Oriented Programming. 1998;Addison-Wesley
27. P. Wadler and K. Weihe. Component-based programming under different paradigms. Technical report, Report on the Dagstuhl Seminar 99081, February 1999.