The connection between initial and unique solutions of domain equations in the partial order and metric approach
作者： Christel Baier , Mila Majster-Cederbaum
DOI: 10.1007/BF01211300
关键词:
摘要: The purpose of this paper is twofold: First, we show in which way the initial solution a domain equation for cpo's and unique corresponding metric spaces are related. Second, present technique to lift given spaces.
springer.com
sci-hub.se 参考文章(19)
Abbas Edalat, Michael B. Smyth, Compact Metric Information Systems (Extended Abstract) Proceedings of the REX Workshop on Sematics: Foundations and Applications. pp. 154- 173 ,(1992) , 10.1007/3-540-56596-5_33
Christel Baier, Mila Majster-Cederbaum, How To Interpret And Establish Consistency Results For Semantics Of Concurrent Programming Languages Fundamenta Informaticae. ,vol. 29, pp. 225- 256 ,(1997) , 10.3233/FI-1997-29302
Kim R. Wagner, Solving Recursive Domain Equations with Enriched Categories. ,(1994)
Viggo Stoltenberg-Hansen, C. J. van Rijsbergen, Edward R. Griffor, Ingrid Lindström, Mathematical theory of domains ,(1994)
Samson Abramsky, None, A domain equation for bisimulation Information & Computation. ,vol. 92, pp. 161- 218 ,(1991) , 10.1006/INCO.1991.9999
Mila E. Majster-Cederbaum, F. Zetzsche, Towards a foundation for semantics in complete metric spaces Information & Computation. ,vol. 90, pp. 217- 243 ,(1991) , 10.1016/0890-5401(91)90005-M
Pierre America, Jan Rutten, Solving reflexive domain equations in a category of complete metric spaces Journal of Computer and System Sciences. ,vol. 39, pp. 343- 375 ,(1989) , 10.1016/0022-0000(89)90027-5
Hartmut Ehrig, Francesco Parisi-Presicce, Paul Boehm, Catharina Rieckhoff, Cristian Dimitrovici, Martin Grosse-Rhode, Combining data type and recursive process specifications using projection algebras Theoretical Computer Science. ,vol. 71, pp. 347- 380 ,(1990) , 10.1016/0304-3975(90)90049-N
Kim Bruce, John C. Mitchell, PER models of subtyping, recursive types and higher-order polymorphism symposium on principles of programming languages. pp. 316- 327 ,(1992) , 10.1145/143165.143230
Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini, The complexity of computing the number of strings of given length in context-free languages Theoretical Computer Science. ,vol. 86, pp. 325- 342 ,(1991) , 10.1016/0304-3975(91)90023-U