Skip to main content
SpringerLink
Log in

Fully effective solutions of recursive domain equations

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kanda, A, Data types as effective object, Theory of Computation Report No. 22, Warwick University, (1977).

    Google Scholar 

  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. Lehmann-Smyth, Data Types, Proc. of the 18th IEEE FOCS Conference, (1977).

    Google Scholar 

  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. Scott D., Data types as lattices, Unpublished lecture notes, Amsterdam, (1972).

    Google Scholar 

  6. Scott D., Data types as lattices, SIAM J. on Computing, Vol. 5, (1976).

    Google Scholar 

  7. Smyth-Plotkin, The categorical solution of recursive domain equations, Proc. of the 18th IEEE FOCS Conference, (1977).

    Google Scholar 

  8. Tennent R., The denotational semantics of programming languages, CACM, Vol. 19, No. 18, (1977).

    Google Scholar 

  9. Egli-Constable, Computability concepts for programming language semantics, Theoretical Computer Science, Vol. 2, (1976).

    Google Scholar 

  10. Rosen-Markowsky, Bases for chain complete posets, IBM J. of R&D, Vol. 5, No. 3, (1976).

    Google Scholar 

  11. Smyth M., Effectively given domains, Theoretical Computer Science, Vol. 5, (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Studies, University of Leeds, LS2 9JT, Leeds, U.K.

    Akira Kanda

Authors
  1. Akira Kanda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanda, A. (1979). Fully effective solutions of recursive domain equations. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation