Admissible representations of effective cpo's

  • Klaus Weihrauch
  • Gisela Schäfer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Standard Representation Recursive Function Computable Function Admissible Representation Effective Synthesis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Scott, Data types as lattices, SIAM J. on Computing 5 (1976) 522–587.Google Scholar
  2. 2.
    H. Egli, R.L. Constable, Computability concepts for programming language semantics, Theoretical Computer Science 2 (1976) 133–145.Google Scholar
  3. 3.
    M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257–274.Google Scholar
  4. 4.
    E. Sciore, A. Tang, Admissible coherent c.p.o.'s, in: G. Ausiello, C. Böhm, Ed., Automata, Languages and Programming, 5th Colloquium, Lecture Notes in Comp. Sci. 62 (Springer, Berlin, 1978) 440–456.Google Scholar
  5. 5.
    A. Kanda, D. Park, When are two effectively given domains identical, in: K. Weihrauch, Ed., Theoretical Computer Science, 4th GI-Conference, Lecture Notes in Comp. Sci. 67 (Springer, Berlin, 1979) 170–181.Google Scholar
  6. 6.
    K.Weihrauch, T.Deil, Berechenbarkeit auf cpo-s, Informatik-Berichte 63, RWTH Aachen (1980).Google Scholar
  7. 7.
    K.Weihrauch, Rekursionstheorie und Komplexitätstheorie auf effektiven cpo-s, Informatik-Berichte 9, Fernuniversität Hagen (1980).Google Scholar
  8. 8.
    H. Rogers, Theory of recursive functions and effective computability (McGraw-Hill, New York, 1967).Google Scholar
  9. 9.
    D. Scott, Continuous lattices, in: F.W. Lawvere, Ed., Toposes, Algebraic Geometry and Logic, Lecture Notes in Mathematics 274 (Springer, Berlin, 1972) 97–136.Google Scholar
  10. 10.
    A. Reiser, K. Weihrauch, Natural numberings and generalized computability, EIK 16 (1980) 1–3, 11–20.Google Scholar
  11. 11.
    M. Davis, Computability and Unsolvability (McGraw-Hill, New York, 1958).Google Scholar
  12. 12.
    J. Hauck, Berechenbare reelle Funktionen, Zeitschrift f. mathem. Logik und Grundlagen der Mathematik 19 (1973) 121–140.Google Scholar
  13. 13.
    G.Schäfer, K.Weihrauch, Admissible representations of effective cpo-s, Informatik-Berichte 16, Fernuniversität Hagen (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  • Gisela Schäfer
    • 2
  1. 1.Fachbereich Mathematik, Lehrgebiet Informatik Fernuniversität Gesamthochschule HagenHagen
  2. 2.Lehrstuhl für Informatik I, RWTH AachenAachen

Personalised recommendations