Skip to main content
SpringerLink
Log in

Polymorphic type schemes and recursive definitions

  • Conference paper
  • First Online:
International Symposium on Programming (Programming 1984)

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

Included in the following conference series:

Abstract

An extension to Milner's polymorphic type system is proposed and proved correct. Such an extension appears to be necessary for the class of languages with mutually recursive top-level definitions. We can now ascribe a more general type to such definitions than before.

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. Burstall, R., MacQueen, D.B. and Sannella, D.T. HOPE: an experimental applicative language. Internal report, Dept. of Computer Science, Edinburgh University, 1980.

    Google Scholar 

  2. Damas, L. and Milner, R. Principal type schemes for functional programs. Proc. 9th ACM Symp. on Principles of programming languages, 1982.

    Google Scholar 

  3. Gordon, M., Milner, R. and Wadsworth, C. Edinburgh LCF. Springer-Verlag LNCS 78, 1979.

    Google Scholar 

  4. Homström, S. Polymorphic type schemes and concurrent computation in functional languages. PhD thesis, Dept. of Computer Science, Chalmers TH, S-412 96 Göteborg, 1983.

    Google Scholar 

  5. Milner, R. A theory of type polymorphism in programming. Journal of computer and system sciences, 17(3), 1978.

    Google Scholar 

  6. Mycroft, A. and O'Keefe, R.A. A polymorphic type system for Prolog. To appear in Artificial Intelligence. Preliminary version in DAI research report. Dept. of Artificial Intelligence, Edinburgh University.

    Google Scholar 

  7. MacQueen, D.B., Plotkin, G.D. and Sethi, R. An ideal model for recursive polymorphic types. Proc. 11th ACM Symp. on Principles of programming languages, 1984.

    Google Scholar 

  8. MacQueen, D.B. and Sethi, R. A semantic model of types for applicative languages. Proc. Aspenäs workshop 1982.

    Google Scholar 

  9. Robinson, J.A. A machine oriented logic based on the resolution principle. JACM 12(1), 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Methodology Group, Institutionen för Informationsbehandling Chalmers Tekniska Högskola, S-412 96, Göteborg, Sweden

    Alan Mycroft

Authors
  1. Alan Mycroft
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Paul B. Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mycroft, A. (1984). Polymorphic type schemes and recursive definitions. In: Paul, M., Robinet, B. (eds) International Symposium on Programming. Programming 1984. Lecture Notes in Computer Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12925-1_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-12925-1_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38809-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation