Report on the programming language Haskell
Authors:
- Paul HudakPHPaul Hudak
- Simon Peyton JonesSJSimon Peyton Jones
- Philip WadlerPWPhilip Wadler
- Brian BoutelBBBrian Boutel
- Jon FairbairnJFJon Fairbairn
- Joseph FaselJFJoseph Fasel
- María M. GuzmánMGMaría M. Guzmán
- Kevin HammondKHKevin Hammond
- John HughesJHJohn Hughes
- Thomas JohnssonTJThomas Johnsson
- Dick KieburtzDKDick Kieburtz
- Rishiyur NikhilRNRishiyur Nikhil
Open Access
- 1 May 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 27 (5) , 1-164
Abstract
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published something erroneous. Since some of our fellow sinners are among the most careful and competent logicians on the contemporary scene, we regard this as evidence that the subject is refractory. Thus fullness of exposition is necessory for accurary; and excessive condensation would be false economy here, even more than it is ordinarily."Keywords
This publication has 11 references indexed in Scilit:
- How to make ad-hoc polymorphism less ad hoc1989
- A new array operationLecture Notes in Computer Science, 1987
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- Principal type-schemes for functional programs1982
- HOPE1980
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- A Metalanguage for interactive proof in LCF1978
- A Formalization of Floating-Point Numeric Base ConversionIEEE Transactions on Computers, 1970
- The next 700 programming languagesCommunications of the ACM, 1966
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960