Report on the Programming Language Haskell: A Non-Strict, Purely Functional Language Version 1.2

ACM SIGPLAN Notices

Volumn 27, Issue 5, 1992, Pages 1-164

  Hudak, Paul ^a   Peyton Jones, Simon ^b   Wadler, Philip ^b   Boutel, Brian ^c   Fairbairn, Jon ^d   Fasel, Joseph ^e   Guzmán, María M ^a   Hammond, Kevin ^b   Hughes, John ^b   Johnsson, Thomas ^f   Kieburtz, Dick ^g   Nikhil, Rishiyur ^h   Partain, Will ^b   Peterson, John ^a  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^d UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^e LOS ALAMOS NATIONAL LABORATORY   (United States)

^f CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^g OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^h MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84969385445     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/130697.130699     Document Type: Article

References (12)

1. J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. CACM, 21(8):613-641, August 1978.
2. R.M. Burstall, D.B. MacQueen, and D.T. Sannella. HOPE: An experimental applicative language. In The 1980 LISP Conference, pages 136-143, Stanford University, August 1980.
3. L. Damas and R. Milner. Principal type schemes for functional programs. In Proceedings of 9th ACM Symposium on Principies of Programming Languages, pages 207-212, Albuquerque, N.M., January 1982.
4. M. Gordon, R. Milner, L. Morris, M. Newey, and C. Wadsworth. A metalanguage for interactive proof in LCF. In Proceedings of 5th ACM Symposium on Principles of Programming Languages, pages 119-130, 1978.
5. K. Hammond and C. Hall. A natural dynamic semantics for Haskell (draft). Department of Computing Science, Glasgow University, February 1991.
6. R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, December 1969.
7. P. Hudak and R. Sundaresh. On the expressiveness of purely functional I/O systems. Technical Report YALEU/DCS/RR665, Yale University, Department of Computer Science, December 1988.
8. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, Part I. CACM, 3(4):184-195, April 1960.
9. P. Penfield, Jr. Principal values and branch cuts in complex APL. In APL ‘81 Conference Proceedings, pages 248-256, San Francisco, September 1981.
10. J. Rees and W. Clinger (eds.). The revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(12):37-79, December 1986.
11. P. Wadler. A new array operation. In J.H. Fasel and R.M. Keller, editors, Graph Reduction, volume 279 of Lecture Notes in Computer Science, pages 328-335, Heidelberg, 1987. Springer-Verlag.
12. P. Wadler and S. Blott. How to make ad hoc polymorphism less ad hoc. In Proceedings of 16th ACM Symposium on Principles of Programming Languages, pages 60-76, Austin, Texas, January 1989.