Observation systems

Electronic Notes in Theoretical Computer Science

Volumn 33, Issue , 2000, Pages 261-275

  Monteiro, Luís ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA ACQUISITION; FUNCTIONS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

COALGEBRAS; CONCURRENCY; FUNCTORS; OBSERVATION SYSTEMS;

SEMANTICS;

EID: 18944395417     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80351-2     Document Type: Conference Paper

References (13)

1. Aczel P. Non- Well-Founded Sets. 1988;CSLI Lecture Notes. Center for the Study of Languages and Information, Stanford
2. Aczel P., Mendler N. A Final Coalgebra Theorem. Pitt D.H., Ryeheard D.E., Dybjer P., Pitts A.M., Poigne A. Category Theory and Computer Science, volume 389 of Lecture Notes in Computer Science. 1989;357-365 Springer-Verlag
3. Arbib M.A., Manes E.G. Parametrized data types do not need highly constrained parameters. Information and Control. 52:(2):1982;139-152
4. de Bakker J.W., de Vink E.P. Control Flow Semantics. Foundations of Computing Series. 1996;The MIT Press
5. Goguen J.A., 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
6. Jacobs B. Objects and classes, co-algebraically. Freitag B., Jones C.B., Lengauer C., Schek H.-J. Object-Orientation with Parallelism and Persistence. 1996;83-103 Kluwer Academic Publishers
7. Mac Lane S. Categories for the Working Mathematician. 1971;Springer-Verlag
8. Monteiro L. Semantic domains based on sets with families of equivalences. Jacobs B., Moss L., Reichel H., Rutten J. guest editors, Coalgebraic Methods in Computer Science (CMCS'98), Electronic Notes in Theoretical Computer Science. 11:1998;73-106
9. Monteiro L. All nontrivial set functors give rise to final coalgebras. Departamento de Informática, Universidade Nova de Lisboa. 1999
10. Reichel H. An approach to object semantics based on terminal co-algebras. Mathematical Structures in Computer Science. 5:1995;129-152
11. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Report CS-R9652, CWI. 1996
12. Rutten J.J.M.M., Turi D. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. de Bakker J.W., de Roever W.-P., Rozenberg G. Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science. 1993;477-530 Springer-Verlag
13. Rutten J.J.M.M., Turi D. Initial algebra and final coalgebra semantics for concurrency. de Bakker J.W., de Roever W.-P., Rozenberg G. A Decade of Concurrency, volume 803 of Lecture Notes in Computer Science. 1994;530-582 Springer-Verlag