Miranda: A non-strict functional language with polymorphic types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 201 LNCS, Issue , 1985, Pages 1-16

  Turner, D A ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84922995178     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15975-4_26     Document Type: Conference Paper

References (12)

1. Burstall "Proving properties of programs by structural induction" Computer Journal, vol 12, 1969
2. Burstall McQueen & S. Sannella "HOPE: An experimental applicative language" Proceedings 1st International LISP conference, Stanford 1980.
3. Gordon, Milner & W. Wadsworth "Edinburgh LCF" Springer Lecture Notes in Computer Science vol 78, 1979
4. H. Hoare "Recursive data structures" International Journal of Computer and Information Sciences, June 1975
5. L. Landin "The Mechanical Evaluation of Expressions" Computer Journal, January 1964
6. M. McQueen "Modules for Standard ML" Proceedings 3rd International Conference on LISP and functional programming, Austin Texas, August 1984.
7. M. Milner "A Theory of Type Polymorphism in Programming" Journal of Computer and System Sciences, vol 17,1978
8. M. Mycroft "Polymorphic type schemes and recursive definitions" Proceedings 6th International Conference on Programming, Toulouse April 1984 (Springer Verlag LNCS vol 167)
9. R. Richards "An overview of ARC SASL" Sigplan Notices October 1984
10. T. Turner "SASL Language Manual" St Andrews University Technical Report, December 1976
11. T. Turner "Aspects of the implementation of programming languages" D. Phil Thesis, Oxford 1981
12. T. Turner "Recursion equations as a programming language" in Functional Programming and Its Applications, ed Darlington et al., CUP 1982