Skip to main content
SpringerLink
Log in

Applicative information systems

  • Invited Lectures
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

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. H. Barendregt, The λ-calculus: its syntax and semantics. North-Holland, 1981.

    Google Scholar 

  2. M. Coppo, M. Dezani, F. Honsell, G. Longo, ”Extended Type Structure and Filter lambda models” Logic Colloquium '82 (Lolli, Longo, Marcja eds.) North-Holland, 1983.

    Google Scholar 

  3. Yu.L. Ershov, ”Model C of partial continuous functionals” in Logic Colloquium '76 (Gandy, Hyland eds) Nort-Holland, 1977.

    Google Scholar 

  4. P. Giannini, G. Longo, ”Effectively given domains and λ-calcul semantics” Revised version, ISI-Nota Scientifica (1982).

    Google Scholar 

  5. D. Lehmann, M. Smyth, ‘Algebraic Specification of Data Types: A synthetic Approach’ Mathematical System Theory, 14 (1981), 97–139.

    Article  Google Scholar 

  6. R. Milner, ”A theory of type polymorphism in programming” Journal of Computer and System Sciences, 3 (1978), 348–375.

    Article  Google Scholar 

  7. G. Plotkin, ”Call-by-name, call-by-value and the λ-calculus” Theoretical Computer Science 1 (1975), 125–159.

    Article  Google Scholar 

  8. G. Plotkin, M. Smyth, ”The cathegory-theoretic solution of recursive domain equations” Internal Report University of Edinburgh (1982), (To appear in SIAM Journal of Computing).

    Google Scholar 

  9. H. Rogers, Theory of recursive functions and effective computability, Mc-Graw-Hill, 1967.

    Google Scholar 

  10. D.S. Scott, ”Continuous Lattices”, Springer Lecture Notes in Mathematics, vol. 274, (1972), 97–136.

    Google Scholar 

  11. D.S. Scott, ”Data types as lattices”, SIAM Journal of Computing 5 (1976), 522–587.

    Article  Google Scholar 

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

    Google Scholar 

  13. D.S. Scott, ”Domains for Denotational Semantics (updated version)”. Proceedings of ICALP '82, LNCS 140, Springer-Verlag, Berlin (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Italy

    M. Coppo & M. Dezani

  2. Dipartimento di Informatica, Università di Pisa, Italy

    G. Longo

Authors
  1. M. Coppo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dezani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Longo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coppo, M., Dezani, M., Longo, G. (1983). Applicative information systems. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation