File: haskell.html

package info (click to toggle)
haskell-doc 19991028-1
  • links: PTS
  • area: main
  • in suites: potato, woody
  • size: 1,672 kB
  • ctags: 620
  • sloc: haskell: 2,123; makefile: 158; sh: 31
file content (56 lines) | stat: -rw-r--r-- 2,601 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

<title>The Haskell 1.3 Report: Bibliography</title>
<body bgcolor="#ffffff"> <i>The Haskell 98 Report</i><br> <a href="index.html">top</a> | <a href="pragmas.html">back</a> | next | <a href="index98.html">contents</a> | <a href="prelude-index.html">function index</a> <br><hr>
<p>
<a name="$back78"></a>[1] 
J. Backus.
Can programming be liberated from the von Neumann style? A
  functional style and its algebra of programs.
<I>CACM</I>, 21(8):613--641, August 1978.<p>
<a name="$curry&feys:book"></a>[2] 
H.B. Curry and R. Feys.
<I>Combinatory Logic</I>.
North-Holland Pub. Co., Amsterdam, 1958.<p>
<a name="$damas-milner82"></a>[3] 
L. Damas and R. Milner.
Principal type schemes for functional programs.
In <I>Proceedings of the 9th ACM Symposium on Principles of
  Programming Languages</I>, pages 207--212, Albuquerque, N.M., January 1982.<p>
<a name="$hindley69"></a>[4] 
R. Hindley.
The principal type scheme of an object in combinatory logic.
<I>Transactions of the American Mathematical Society</I>, 146:29--60,
  December 1969.<p>
<a name="$tutorial"></a>[5] 
P. Hudak, J. Fasel, and J. Peterson.
A gentle introduction to Haskell.
Technical Report YALEU/DCS/RR-901, Yale University, May 1996.<p>
<a name="$jones:cclasses"></a>[6] 
Mark P. Jones.
A system of constructor classes: overloading and implicit
  higher-order polymorphism.
<I>Journal of Functional Programming</I>, 5(1), January 1995.<p>
<a name="$penfield:complex-apl"></a>[7] 
P. Penfield, Jr.
Principal values and branch cuts in complex APL.
In <I>APL '81 Conference Proceedings</I>, pages 248--256, San
  Francisco, September 1981.<p>
<a name="$libraries"></a>[8] 
J. Peterson (editor).
The Haskell Library Report.
Technical Report YALEU/DCS/RR-1105, Yale University, May 1996.<p>
<a name="$peyton-jones:book"></a>[9] 
S.L. Peyton Jones.
<I>The Implementation of Functional Programming Languages</I>.
Prentice-Hall International, Englewood Cliffs, New Jersey, 1987.<p>
<a name="$unicode"></a>[10] 
Unicode Consortium.
<I>Unicode Character Data and Mappings</I>.
unicode.org.<p>
<a name="$wadler:classes"></a>[11] 
P. Wadler and S. Blott.
How to make <I>ad hoc</I> polymorphism less <I>ad hoc</I>.
In <I>Proceedings of the 16th ACM Symposium on Principles of
  Programming Languages</I>, pages 60--76, Austin, Texas, January 1989.<p>

<hr><i>The Haskell 98 Report</i><br><a href="index.html">top</a> | <a href="pragmas.html">back</a> | next | <a href="index98.html">contents</a> | <a href="prelude-index.html">function index</a> <br><font size=2>1 February, 1999</font>