Admissible coherent c.p.o.'s

  • E. Sciore
  • A. Tang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (1).
    G. Plotkin, \(\mathbb{T}^\omega \) as a universal domain, University of Edinburgh, 1977.Google Scholar
  2. (2).
    H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill.Google Scholar
  3. (3).
    D. Scott, Continuous lattices, Lecture notes in mathematics, no. 274, Springer Verlag.Google Scholar
  4. (4).
    D. Scott, Outline of a mathematical theory of computation, Proc. 4th Annual Princeton Conference on Information Science and Systems, 1970.Google Scholar
  5. (5).
    D. Scott, Data types as lattices, Siam Journal on Computing, 1976.Google Scholar
  6. (6).
    M. Smyth, Effectively given domains, University of Warwick, 1976.Google Scholar
  7. (7).
    A. Tang, Recursion theory in effectively given T0-spaces, Oxford University, 1974.Google Scholar
  8. (8).
    E. Sciore and A. Tang, Computability theory in admissible domains, Princeton University, 1977.Google Scholar
  9. (9).
    E. Sciore and A. Tang, Effective domains, Princeton University, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • E. Sciore
    • 1
  • A. Tang
    • 1
  1. 1.Department of Electrical Engineering & Computer SciencePrinceton UniversityPrincetonUSA

Personalised recommendations