Skip to main content
SpringerLink
Log in

Using information systems to solve reoursive domain equations effectively

  • Conference paper
  • First Online:
Semantics of Data Types (SDT 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 173))

Included in the following conference series:

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. Aczel, P., A note on Scott's theory of domains. Unpublished note, Math. Dept., Univ. of Manchester, (1983).

    Google Scholar 

  2. Berry, G., Modeles Completement Adequats et Stables des λ-calculus typés. These de Doctorat dÉtat, Université Paris VII, (1979).

    Google Scholar 

  3. Berry, G. and Curien, P.L., Sequential algorithms on concrete data structures. Report of Ecole Nationale Superieure des Mines de Paris, Centre de Mathematiques Appliquées, Sophia Antipolis, (1981).

    Google Scholar 

  4. Cutland, N.J., Computability, an introduction to recursive function theory. Cambridge University Press, (1980).

    Google Scholar 

  5. Coppo, M., Dezani, M. and Longo, G., Applicative Informative Systems. Universita Degli Studi di Pisa Dipartimento di Informatica, (1983).

    Google Scholar 

  6. Curien, P-L., Algorithmes sequentiels et extensionnalité. Rapport LITP 82-67 Universite Paris VII, (1982).

    Google Scholar 

  7. Grätzer, G., Universal Algebra. Van Nostrand University series in Higher Mathematics, (1968).

    Google Scholar 

  8. Kahn, G. and Plotkin, G., Domaines Concrètes. Rapport IRIA Laboria No. 336, (1978).

    Google Scholar 

  9. MacLane, S., Categories for the working mathematician. Springer-Verlag Graduate Texts in Math., (1971).

    Google Scholar 

  10. McCarty, C., Information Systems, Continuity and Realizability. Notices of the AMS, August issue, (1983).

    Google Scholar 

  11. Nielsen, M., Plotkin, G. and Winskel, G., Petri nets, event structures and domains. Theor. Comp. Sc., (1981).

    Google Scholar 

  12. Plotkin, G.D., The category of complete partial orders: a tool for making meanings. Lecture notes, Pisa Summer School, (1978).

    Google Scholar 

  13. Plotkin, G.D., A powerdomain construction. SIAM Journal on Computing, vol.5, no.3, p.452–487, (1976).

    Google Scholar 

  14. Scott, D.S., Domains for Denotational Semantics. ICALP 1982.

    Google Scholar 

  15. Scott, D.S., Lectures on a mathematical theory of computation. Oxford University Computing Laboratory Technical Monograph PRG-19, (1981).

    Google Scholar 

  16. Effectively given domains. Theoretical Computer Science, vol.5, pp.257–274 (1977).

    Google Scholar 

  17. Smyth, M., The largest cartesian-closed category of domains. Theor. Comp. Sc. (1983).

    Google Scholar 

  18. Stoy, J., Denotational semantics: The Scott-Strachey approach to programming language theory. MIT Press, (1977).

    Google Scholar 

  19. Winskel, G., Event structure semantics of CCS and related languages. Report of Comp. Sc. Dept., Aarhus University, My Munkegade, 8000 Aarhus C, Denmark, and extended abstract in proc. ICALP 82 in Springer LNCS (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Edinburgh, King's Buildings, Mayfield Rd, Scotland EH9 3JZ, Edinburgh, G.B.

    K. G. Larsen

  2. Computer Laboratory, University of Cambridge, Corn Exchange Street, CB2 3QC, Cambridge, G.B.

    G. Winskel

Authors
  1. K. G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Winskel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gilles Kahn David B. MacQueen Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Larsen, K.G., Winskel, G. (1984). Using information systems to solve reoursive domain equations effectively. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds) Semantics of Data Types. SDT 1984. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13346-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-13346-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13346-9

  • Online ISBN: 978-3-540-38891-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation