Skip to main content
SpringerLink
Log in

Miranda: A non-strict functional language with polymorphic types

  • Conference paper
  • First Online:
Functional Programming Languages and Computer Architecture (FPCA 1985)

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

‘Miranda’ is a trademark of Research Software Ltd.

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

  • Burstall "Proving properties of programs by structural induction" Computer Journal, vol 12, 1969

    Google Scholar 

  • Burstall McQueen & Sannella "HOPE: An experimental applicative language" Proceedings 1st International LISP conference, Stanford 1980.

    Google Scholar 

  • Gordon, Milner & Wadsworth "Edinburgh LCF" Springer Lecture Notes in Computer Science vol 78, 1979

    Google Scholar 

  • Hoare "Recursive data structures" International Journal of Computer and Information Sciences, June 1975

    Google Scholar 

  • Landin "The Mechanical Evaluation of Expressions" Computer Journal, January 1964

    Google Scholar 

  • McQueen "Modules for Standard ML" Proceedings 3rd International Conference on LISP and functional programming, Austin Texas, August 1984.

    Google Scholar 

  • Milner "A Theory of Type Polymorphism in Programming" Journal of Computer and System Sciences, vol 17, 1978

    Google Scholar 

  • Mycroft "Polymorphic type schemes and recursive definitions" Proceedings 6th International Conference on Programming, Toulouse April 1984 (Springer Verlag LNCS vol 167)

    Google Scholar 

  • Richards "An overview of ARC SASL" Sigplan Notices October 1984

    Google Scholar 

  • Turner "SASL Language Manual" St Andrews University Technical Report, December 1976

    Google Scholar 

  • Turner "Aspects of the implementation of programming languages" D. Phil Thesis, Oxford 1981

    Google Scholar 

  • Turner "Recursion equations as a programming language" in Functional Programming and Its Applications, ed Darlington et al., CUP 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Kent, Canterbury, England

    D. A. Turner

Authors
  1. D. A. Turner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Turner, D.A. (1985). Miranda: A non-strict functional language with polymorphic types. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-15975-4_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation