Advertisement

Fully effective solutions of recursive domain equations

  • Akira Kanda
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)

Abstract

This paper studies how we can exclude noncomputable elements of effectively given domains to obtain effective domains, and how we can obtain an effective domain which is an effectively initial solution to a recursive domain equation.

Keywords

Recursive Function Inverse Limit Effective Domain Total Indexing Characteristic Pair 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Kanda, A, Data types as effective object, Theory of Computation Report No. 22, Warwick University, (1977).Google Scholar
  2. [2]
    Kanda-Park, When two effectively given domains are identical, Proc. of the 4th GI Theoretical Computer Science Conference, Lecture Notes in Computer Science No. 67, (1979).Google Scholar
  3. [3]
    Lehmann-Smyth, Data Types, Proc. of the 18th IEEE FOCS Conference, (1977).Google Scholar
  4. [4]
    Scott-Strachey, Towards a mathematical semantics of computer languages, Proc. of Symposium on Computer and Automata, Polytechnical Inst. of Brooklyn (1971).Google Scholar
  5. [5]
    Scott D., Data types as lattices, Unpublished lecture notes, Amsterdam, (1972).Google Scholar
  6. [6]
    Scott D., Data types as lattices, SIAM J. on Computing, Vol. 5, (1976).Google Scholar
  7. [7]
    Smyth-Plotkin, The categorical solution of recursive domain equations, Proc. of the 18th IEEE FOCS Conference, (1977).Google Scholar
  8. [8]
    Tennent R., The denotational semantics of programming languages, CACM, Vol. 19, No. 18, (1977).Google Scholar
  9. [9]
    Egli-Constable, Computability concepts for programming language semantics, Theoretical Computer Science, Vol. 2, (1976).Google Scholar
  10. [10]
    Rosen-Markowsky, Bases for chain complete posets, IBM J. of R&D, Vol. 5, No. 3, (1976).Google Scholar
  11. [11]
    Smyth M., Effectively given domains, Theoretical Computer Science, Vol. 5, (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Akira Kanda
    • 1
  1. 1.Department of Computer StudiesUniversity of LeedsLeedsU.K.

Personalised recommendations