Semantic domains based on sets with families of equivalences

Electronic Notes in Theoretical Computer Science

Volumn 11, Issue , 1998, Pages 71-104

  Monteiro, Luís ^a  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

EQUIVELENCE RELATIONS; MATHEMATICAL PROBLEMS; MATHEMATICAL SOPHISTICATION; SEMANTIC DOMAINS;

SEMANTICS;

EID: 18944404475     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00054-4     Document Type: Article

References (8)

1. America P., Rutten J.J.M.M. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences. 39:1989;343-375
2. de Bakker J.W., de Vink E.P. Control Flow Semantics. Foundations of Computing Series. 1996;The MIT Press
3. de Bakker J.W., Zucker J.I. Processes and the denotational semantics of concurrency. Information and Control. 54:1982;70-120
4. Davey B.A., Priestley H.A. Introduction to Lattices and Order. 1990;Cambridge University Press
5. J.J.M.M. Rutten and D. Turi. On the foundations of final semantics: non-standard sets, metric spaces, partial orders. In J.W. de Bakker, W.-P. de Roever and G. Rozenberg, authors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 477-530, Springer-Verlag, 1993.
6. J.J.M.M. Rutten. Elements of generalized ultrametric domain theory. CWI, Research Report CS-R9507, 1995.
7. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. CWI, Research Report CS-R9652, 1996.
8. V. Stoltenberg-Hansen and J.V. Tucker. Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms. In J.W. de Bakker, W.-P. de Roever and G. Rozenberg, authors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 531-562, Springer-Verlag, 1993.