Bibliography
263
Domain Theory, ISDT (2001), Sichuan University, Chengdu, China, October, 2001, Semantic Structures in Computation, Volume 3, pages 75–
115. Kluwer Academic Publishers, Dordrecht, The Netherlands.
[Simons et al., 2002] Simons, P., Niemel¨ a, I., and Soininen, T. (2002). Extending and implementing the stable model semantics. Artificial Intelligence,
138:181–234.
[Smyth, 1987] Smyth, M. B. (1987). Quasi uniformities: Reconciling domains
with metric spaces. In Main, M. G., Melton, A., Mislove, M. W., and
Schmidt, D. A., editors, Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Volume 198, pages
236–253. Springer, Berlin.
[Smyth, 1991] Smyth, M. B. (1991). Totally bounded spaces and compact
ordered spaces as domains of computation. In Reed, G. M., Roscoe,
A. W., and Wachter, R. F., editors, Topology and Category Theory in
Computer Science, pages 207–229. Oxford University Press, Oxford, UK.
[Smyth, 1992] Smyth, M. B. (1992). Topology. In Abramsky, S., Gabbay,
D. M., and Maibaum, T. S., editors, Handbook of Logic in Computer
Science Volume 1, pages 641–761. Oxford University Press, Oxford, UK.
[Stoltenberg-Hansen et al., 1994] Stoltenberg-Hansen, V., Lindstr¨ om, I., and
Griffor, E. R. (1994). Mathematical Theory of Domains. Cambridge
Tracts in Theoretical Computer Science No. 22. Cambridge University
Press, Cambridge, UK.
[Straccia et al., 2009] Straccia, U., Ojeda-Aciego, M., and Dam´ asio, C. V.
(2009). On fixed points of multivalued functions on complete lattices
and their application to generalized logic programs. SIAM Journal of
Computing, 38(5):1881–1911.
[van Emden and Kowalski, 1976] van Emden, M. H. and Kowalski, R. A.
(1976). The semantics of predicate logic as a programming language.
Journal of the ACM, 23(4):733–742.
[Van Gelder et al., 1991] Van Gelder, A., Ross, K. A., and Schlipf, J. S.
(1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650.
[Waszkiewicz, 2002] Waszkiewicz, P. (2002). Quantitative Continuous Domains. PhD thesis, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, UK.
[Waszkiewicz, 2003] Waszkiewicz, P. (2003). Quantitative continuous domains. Applied Categorical Structures, 11(1):41–67.
[Waszkiewicz, 2006] Waszkiewicz, P. (2006). Partial metrizability of continuous posets. Mathematical Structures in Computer Science, 16(2):359–372.
263
Domain Theory, ISDT (2001), Sichuan University, Chengdu, China, October, 2001, Semantic Structures in Computation, Volume 3, pages 75–
115. Kluwer Academic Publishers, Dordrecht, The Netherlands.
[Simons et al., 2002] Simons, P., Niemel¨ a, I., and Soininen, T. (2002). Extending and implementing the stable model semantics. Artificial Intelligence,
138:181–234.
[Smyth, 1987] Smyth, M. B. (1987). Quasi uniformities: Reconciling domains
with metric spaces. In Main, M. G., Melton, A., Mislove, M. W., and
Schmidt, D. A., editors, Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Volume 198, pages
236–253. Springer, Berlin.
[Smyth, 1991] Smyth, M. B. (1991). Totally bounded spaces and compact
ordered spaces as domains of computation. In Reed, G. M., Roscoe,
A. W., and Wachter, R. F., editors, Topology and Category Theory in
Computer Science, pages 207–229. Oxford University Press, Oxford, UK.
[Smyth, 1992] Smyth, M. B. (1992). Topology. In Abramsky, S., Gabbay,
D. M., and Maibaum, T. S., editors, Handbook of Logic in Computer
Science Volume 1, pages 641–761. Oxford University Press, Oxford, UK.
[Stoltenberg-Hansen et al., 1994] Stoltenberg-Hansen, V., Lindstr¨ om, I., and
Griffor, E. R. (1994). Mathematical Theory of Domains. Cambridge
Tracts in Theoretical Computer Science No. 22. Cambridge University
Press, Cambridge, UK.
[Straccia et al., 2009] Straccia, U., Ojeda-Aciego, M., and Dam´ asio, C. V.
(2009). On fixed points of multivalued functions on complete lattices
and their application to generalized logic programs. SIAM Journal of
Computing, 38(5):1881–1911.
[van Emden and Kowalski, 1976] van Emden, M. H. and Kowalski, R. A.
(1976). The semantics of predicate logic as a programming language.
Journal of the ACM, 23(4):733–742.
[Van Gelder et al., 1991] Van Gelder, A., Ross, K. A., and Schlipf, J. S.
(1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650.
[Waszkiewicz, 2002] Waszkiewicz, P. (2002). Quantitative Continuous Domains. PhD thesis, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, UK.
[Waszkiewicz, 2003] Waszkiewicz, P. (2003). Quantitative continuous domains. Applied Categorical Structures, 11(1):41–67.
[Waszkiewicz, 2006] Waszkiewicz, P. (2006). Partial metrizability of continuous posets. Mathematical Structures in Computer Science, 16(2):359–372.