Domain Theory, Logic and Computation Proceedings of the 2nd International Symposium on Domain Theory, Sichuan, China, October 2001 / edited by Guo-Qiang Zhang, J. Lawson, Ying Ming Liu, M.K. Luo.

Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Guo-Qiang Zhang (Editor), Lawson, J. (Editor), Ying Ming Liu (Editor), Luo, M.K (Editor)
Format: eBook
Language:English
Published: Dordrecht : Springer Netherlands : Imprint: Springer, 2003.
Edition:1st ed. 2003.
Series:Semantics Structures in Computation ; 3
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 1 Playful, streamlike computation
  • 2 Universal types and what they are good for
  • 3 Relational representations of hyper-continuous lattices
  • 4 Convergence classes and spaces of partial functions
  • 5 On meet-continuous dcpos
  • 6 External characterizations of continuous sL-domains
  • 7 Projectives and injectives in the category of quantales
  • 8 On minimal event and concrete data structures
  • 9 A note on strongly finite sequent structures.