/usr/share/doc/haskell98-report/html/haskell98-report-html/index98.html is in haskell98-report 20080907-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 | <title>Haskell 98 Contents</title><body bgcolor="#ffffff"> <i>The Haskell 98 Report</i><br><a href="index.html">top</a> | <a href="prelude-index.html">function index</a> <br><h3>Haskell 98 Report: Contentsx</h3>
<UL><LI><a href="intro.html#sect1">1<tt> </tt>Introduction</a>
<LI><a href="intro.html#sect1.1">1.1<tt> </tt>Program Structure</a>
<LI><a href="intro.html#sect1.2">1.2<tt> </tt>The Haskell Kernel</a>
<LI><a href="intro.html#sect1.3">1.3<tt> </tt>Values and Types</a>
<LI><a href="intro.html#sect1.4">1.4<tt> </tt>Namespaces</a>
<LI><a href="lexemes.html#sect2">2<tt> </tt>Lexical Structure</a>
<LI><a href="lexemes.html#sect2.1">2.1<tt> </tt>Notational Conventions</a>
<LI><a href="lexemes.html#sect2.2">2.2<tt> </tt>Lexical Program Structure</a>
<LI><a href="lexemes.html#sect2.3">2.3<tt> </tt>Comments</a>
<LI><a href="lexemes.html#sect2.4">2.4<tt> </tt>Identifiers and Operators</a>
<LI><a href="lexemes.html#sect2.5">2.5<tt> </tt>Numeric Literals</a>
<LI><a href="lexemes.html#sect2.6">2.6<tt> </tt>Character and String Literals</a>
<LI><a href="lexemes.html#sect2.7">2.7<tt> </tt>Layout</a>
<LI><a href="exps.html#sect3">3<tt> </tt>Expressions</a>
<LI><a href="exps.html#sect3.1">3.1<tt> </tt>Errors</a>
<LI><a href="exps.html#sect3.2">3.2<tt> </tt>Variables, Constructors, Operators, and Literals</a>
<LI><a href="exps.html#sect3.3">3.3<tt> </tt>Curried Applications and Lambda Abstractions</a>
<LI><a href="exps.html#sect3.4">3.4<tt> </tt>Operator Applications</a>
<LI><a href="exps.html#sect3.5">3.5<tt> </tt>Sections</a>
<LI><a href="exps.html#sect3.6">3.6<tt> </tt>Conditionals</a>
<LI><a href="exps.html#sect3.7">3.7<tt> </tt>Lists</a>
<LI><a href="exps.html#sect3.8">3.8<tt> </tt>Tuples</a>
<LI><a href="exps.html#sect3.9">3.9<tt> </tt>Unit Expressions and Parenthesized Expressions</a>
<LI><a href="exps.html#sect3.10">3.10<tt> </tt>Arithmetic Sequences</a>
<LI><a href="exps.html#sect3.11">3.11<tt> </tt>List Comprehensions</a>
<LI><a href="exps.html#sect3.12">3.12<tt> </tt>Let Expressions</a>
<LI><a href="exps.html#sect3.13">3.13<tt> </tt>Case Expressions</a>
<LI><a href="exps.html#sect3.14">3.14<tt> </tt>Do Expressions</a>
<LI><a href="exps.html#sect3.15">3.15<tt> </tt>Datatypes with Field Labels</a>
<LI><a href="exps.html#sect3.15.1">3.15.1<tt> </tt>Field Selection</a>
<LI><a href="exps.html#sect3.15.2">3.15.2<tt> </tt>Construction Using Field Labels</a>
<LI><a href="exps.html#sect3.15.3">3.15.3<tt> </tt>Updates Using Field Labels</a>
<LI><a href="exps.html#sect3.16">3.16<tt> </tt>Expression Type-Signatures</a>
<LI><a href="exps.html#sect3.17">3.17<tt> </tt>Pattern Matching</a>
<LI><a href="exps.html#sect3.17.1">3.17.1<tt> </tt>Patterns</a>
<LI><a href="exps.html#sect3.17.2">3.17.2<tt> </tt>Informal Semantics of Pattern Matching</a>
<LI><a href="exps.html#sect3.17.3">3.17.3<tt> </tt>Formal Semantics of Pattern Matching</a>
<LI><a href="decls.html#sect4">4<tt> </tt>Declarations and Bindings</a>
<LI><a href="decls.html#sect4.1">4.1<tt> </tt>Overview of Types and Classes</a>
<LI><a href="decls.html#sect4.1.1">4.1.1<tt> </tt>Kinds</a>
<LI><a href="decls.html#sect4.1.2">4.1.2<tt> </tt>Syntax of Types</a>
<LI><a href="decls.html#sect4.1.3">4.1.3<tt> </tt>Syntax of Class Assertions and Contexts</a>
<LI><a href="decls.html#sect4.1.4">4.1.4<tt> </tt>Semantics of Types and Classes</a>
<LI><a href="decls.html#sect4.2">4.2<tt> </tt>User-Defined Datatypes</a>
<LI><a href="decls.html#sect4.2.1">4.2.1<tt> </tt>Algebraic Datatype Declarations</a>
<LI><a href="decls.html#sect4.2.2">4.2.2<tt> </tt>Type Synonym Declarations</a>
<LI><a href="decls.html#sect4.2.3">4.2.3<tt> </tt>Datatype Renamings</a>
<LI><a href="decls.html#sect4.3">4.3<tt> </tt>Type Classes and Overloading</a>
<LI><a href="decls.html#sect4.3.1">4.3.1<tt> </tt>Class Declarations</a>
<LI><a href="decls.html#sect4.3.2">4.3.2<tt> </tt>Instance Declarations</a>
<LI><a href="decls.html#sect4.3.3">4.3.3<tt> </tt>Derived Instances</a>
<LI><a href="decls.html#sect4.3.4">4.3.4<tt> </tt>Ambiguous Types, and Defaults for Overloaded Numeric Operations</a>
<LI><a href="decls.html#sect4.4">4.4<tt> </tt>Nested Declarations</a>
<LI><a href="decls.html#sect4.4.1">4.4.1<tt> </tt>Type Signatures</a>
<LI><a href="decls.html#sect4.4.2">4.4.2<tt> </tt>Fixity Declarations</a>
<LI><a href="decls.html#sect4.4.3">4.4.3<tt> </tt>Function and Pattern Bindings</a>
<LI><a href="decls.html#sect4.4.3.1">4.4.3.1<tt> </tt>Function bindings</a>
<LI><a href="decls.html#sect4.4.3.2">4.4.3.2<tt> </tt>Pattern bindings</a>
<LI><a href="decls.html#sect4.5">4.5<tt> </tt>Static Semantics of Function and Pattern Bindings</a>
<LI><a href="decls.html#sect4.5.1">4.5.1<tt> </tt>Dependency Analysis</a>
<LI><a href="decls.html#sect4.5.2">4.5.2<tt> </tt>Generalization</a>
<LI><a href="decls.html#sect4.5.3">4.5.3<tt> </tt>Context Reduction Errors</a>
<LI><a href="decls.html#sect4.5.4">4.5.4<tt> </tt>Monomorphism</a>
<LI><a href="decls.html#sect4.5.5">4.5.5<tt> </tt>The Monomorphism Restriction</a>
<LI><a href="decls.html#sect4.6">4.6<tt> </tt>Kind Inference</a>
<LI><a href="modules.html#sect5">5<tt> </tt>Modules</a>
<LI><a href="modules.html#sect5.1">5.1<tt> </tt>Module Structure</a>
<LI><a href="modules.html#sect5.2">5.2<tt> </tt>Export Lists</a>
<LI><a href="modules.html#sect5.3">5.3<tt> </tt>Import Declarations</a>
<LI><a href="modules.html#sect5.3.1">5.3.1<tt> </tt>What is imported</a>
<LI><a href="modules.html#sect5.3.2">5.3.2<tt> </tt>Qualified import</a>
<LI><a href="modules.html#sect5.3.3">5.3.3<tt> </tt>Local aliases</a>
<LI><a href="modules.html#sect5.3.4">5.3.4<tt> </tt>Examples</a>
<LI><a href="modules.html#sect5.4">5.4<tt> </tt>Importing and Exporting Instance Declarations</a>
<LI><a href="modules.html#sect5.5">5.5<tt> </tt>Name Clashes and Closure</a>
<LI><a href="modules.html#sect5.5.1">5.5.1<tt> </tt>Qualified names</a>
<LI><a href="modules.html#sect5.5.2">5.5.2<tt> </tt>Name clashes</a>
<LI><a href="modules.html#sect5.5.3">5.5.3<tt> </tt>Closure</a>
<LI><a href="modules.html#sect5.6">5.6<tt> </tt>Standard Prelude</a>
<LI><a href="modules.html#sect5.6.1">5.6.1<tt> </tt>The <tt>Prelude</tt> Module</a>
<LI><a href="modules.html#sect5.6.2">5.6.2<tt> </tt>Shadowing Prelude Names</a>
<LI><a href="modules.html#sect5.7">5.7<tt> </tt>Separate Compilation</a>
<LI><a href="modules.html#sect5.8">5.8<tt> </tt>Abstract Datatypes</a>
<LI><a href="basic.html#sect6">6<tt> </tt>Predefined Types and Classes</a>
<LI><a href="basic.html#sect6.1">6.1<tt> </tt>Standard Haskell Types</a>
<LI><a href="basic.html#sect6.1.1">6.1.1<tt> </tt>Booleans</a>
<LI><a href="basic.html#sect6.1.2">6.1.2<tt> </tt>Characters and Strings</a>
<LI><a href="basic.html#sect6.1.3">6.1.3<tt> </tt>Lists</a>
<LI><a href="basic.html#sect6.1.4">6.1.4<tt> </tt>Tuples</a>
<LI><a href="basic.html#sect6.1.5">6.1.5<tt> </tt>The Unit Datatype</a>
<LI><a href="basic.html#sect6.1.6">6.1.6<tt> </tt>Function Types</a>
<LI><a href="basic.html#sect6.1.7">6.1.7<tt> </tt>The IO and IOError Types</a>
<LI><a href="basic.html#sect6.1.8">6.1.8<tt> </tt>Other Types</a>
<LI><a href="basic.html#sect6.2">6.2<tt> </tt>Strict Evaluation</a>
<LI><a href="basic.html#sect6.3">6.3<tt> </tt>Standard Haskell Classes</a>
<LI><a href="basic.html#sect6.3.1">6.3.1<tt> </tt>The Eq Class</a>
<LI><a href="basic.html#sect6.3.2">6.3.2<tt> </tt>The Ord Class</a>
<LI><a href="basic.html#sect6.3.3">6.3.3<tt> </tt>The Read and Show Classes</a>
<LI><a href="basic.html#sect6.3.4">6.3.4<tt> </tt>The Enum Class</a>
<LI><a href="basic.html#sect6.3.5">6.3.5<tt> </tt>The Functor Class</a>
<LI><a href="basic.html#sect6.3.6">6.3.6<tt> </tt>The Monad Class</a>
<LI><a href="basic.html#sect6.3.7">6.3.7<tt> </tt>The Bounded Class</a>
<LI><a href="basic.html#sect6.4">6.4<tt> </tt>Numbers</a>
<LI><a href="basic.html#sect6.4.1">6.4.1<tt> </tt>Numeric Literals</a>
<LI><a href="basic.html#sect6.4.2">6.4.2<tt> </tt>Arithmetic and Number-Theoretic Operations</a>
<LI><a href="basic.html#sect6.4.3">6.4.3<tt> </tt>Exponentiation and Logarithms</a>
<LI><a href="basic.html#sect6.4.4">6.4.4<tt> </tt>Magnitude and Sign</a>
<LI><a href="basic.html#sect6.4.5">6.4.5<tt> </tt>Trigonometric Functions</a>
<LI><a href="basic.html#sect6.4.6">6.4.6<tt> </tt>Coercions and Component Extraction</a>
<LI><a href="io-13.html#sect7">7<tt> </tt>Basic Input/Output</a>
<LI><a href="io-13.html#sect7.1">7.1<tt> </tt>Standard I/O Functions</a>
<LI><a href="io-13.html#sect7.2">7.2<tt> </tt>Sequencing I/O Operations</a>
<LI><a href="io-13.html#sect7.3">7.3<tt> </tt>Exception Handling in the I/O Monad</a>
<LI><a href="standard-prelude.html#sect8">8<tt> </tt>Standard Prelude</a>
<LI><a href="standard-prelude.html#sect8.1">8.1<tt> </tt>Prelude <tt>PreludeList</tt></a>
<LI><a href="standard-prelude.html#sect8.2">8.2<tt> </tt>Prelude <tt>PreludeText</tt></a>
<LI><a href="standard-prelude.html#sect8.3">8.3<tt> </tt>Prelude <tt>PreludeIO</tt></a>
<LI><a href="syntax-iso.html#sect9">9<tt> </tt>Syntax Reference</a>
<LI><a href="syntax-iso.html#sect9.1">9.1<tt> </tt>Notational Conventions</a>
<LI><a href="syntax-iso.html#sect9.2">9.2<tt> </tt>Lexical Syntax</a>
<LI><a href="syntax-iso.html#sect9.3">9.3<tt> </tt>Layout</a>
<LI><a href="syntax-iso.html#sect9.4">9.4<tt> </tt>Literate comments</a>
<LI><a href="syntax-iso.html#sect9.5">9.5<tt> </tt>Context-Free Syntax</a>
<LI><a href="literate.html#sect9.6">9.6<tt> </tt>Literate comments</a>
<LI><a href="derived.html#sect10">10<tt> </tt>Specification of Derived Instances</a>
<LI><a href="derived.html#sect10.1">10.1<tt> </tt>Derived instances of <tt>Eq</tt> and <tt>Ord</tt></a>
<LI><a href="derived.html#sect10.2">10.2<tt> </tt>Derived instances of <tt>Enum</tt></a>
<LI><a href="derived.html#sect10.3">10.3<tt> </tt>Derived instances of <tt>Bounded</tt></a>
<LI><a href="derived.html#sect10.4">10.4<tt> </tt>Derived instances of <tt>Read</tt> and <tt>Show</tt></a>
<LI><a href="derived.html#sect10.5">10.5<tt> </tt>An Example</a>
<LI><a href="pragmas.html#sect11">11<tt> </tt>Compiler Pragmas</a>
<LI><a href="pragmas.html#sect11.1">11.1<tt> </tt>Inlining</a>
<LI><a href="pragmas.html#sect11.2">11.2<tt> </tt>Specialization</a>
<LI><a href="ratio.html#sect12">12<tt> </tt>Rational Numbers</a>
<LI><a href="ratio.html#sect12.1">12.1<tt> </tt>Library <tt>Ratio</tt></a>
<LI><a href="complex.html#sect13">13<tt> </tt>Complex Numbers</a>
<LI><a href="complex.html#sect13.1">13.1<tt> </tt>Library <tt>Complex</tt></a>
<LI><a href="numeric.html#sect14">14<tt> </tt>Numeric</a>
<LI><a href="numeric.html#sect14.1">14.1<tt> </tt>Showing functions</a>
<LI><a href="numeric.html#sect14.2">14.2<tt> </tt>Reading functions</a>
<LI><a href="numeric.html#sect14.3">14.3<tt> </tt>Miscellaneous</a>
<LI><a href="numeric.html#sect14.4">14.4<tt> </tt>Library <tt>Numeric</tt></a>
<LI><a href="ix.html#sect15">15<tt> </tt>Indexing Operations</a>
<LI><a href="ix.html#sect15.1">15.1<tt> </tt>Deriving Instances of <tt>Ix</tt></a>
<LI><a href="ix.html#sect15.2">15.2<tt> </tt>Library <tt>Ix</tt></a>
<LI><a href="array.html#sect16">16<tt> </tt>Arrays</a>
<LI><a href="array.html#sect16.1">16.1<tt> </tt>Array Construction</a>
<LI><a href="array.html#sect16.1.1">16.1.1<tt> </tt>Accumulated Arrays</a>
<LI><a href="array.html#sect16.2">16.2<tt> </tt>Incremental Array Updates</a>
<LI><a href="array.html#sect16.3">16.3<tt> </tt>Derived Arrays</a>
<LI><a href="array.html#sect16.4">16.4<tt> </tt>Library <tt>Array</tt></a>
<LI><a href="list.html#sect17">17<tt> </tt>List Utilities</a>
<LI><a href="list.html#sect17.1">17.1<tt> </tt>Indexing lists</a>
<LI><a href="list.html#sect17.2">17.2<tt> </tt>"Set" operations</a>
<LI><a href="list.html#sect17.3">17.3<tt> </tt>List transformations</a>
<LI><a href="list.html#sect17.4">17.4<tt> unfoldr</tt></a>
<LI><a href="list.html#sect17.5">17.5<tt> </tt>Predicates</a>
<LI><a href="list.html#sect17.6">17.6<tt> </tt>The "<tt>By</tt>" operations</a>
<LI><a href="list.html#sect17.7">17.7<tt> </tt>The "<tt>generic</tt>" operations</a>
<LI><a href="list.html#sect17.8">17.8<tt> </tt>Further "<tt>zip</tt>" operations</a>
<LI><a href="list.html#sect17.9">17.9<tt> </tt>Library <tt>List</tt></a>
<LI><a href="maybe.html#sect18">18<tt> </tt>Maybe Utilities</a>
<LI><a href="maybe.html#sect18.1">18.1<tt> </tt>Library <tt>Maybe</tt></a>
<LI><a href="char.html#sect19">19<tt> </tt>Character Utilities</a>
<LI><a href="char.html#sect19.1">19.1<tt> </tt>Library <tt>Char</tt></a>
<LI><a href="monad.html#sect20">20<tt> </tt>Monad Utilities</a>
<LI><a href="monad.html#sect20.1">20.1<tt> </tt>Naming conventions</a>
<LI><a href="monad.html#sect20.2">20.2<tt> </tt>Class <tt>MonadPlus</tt></a>
<LI><a href="monad.html#sect20.3">20.3<tt> </tt>Functions</a>
<LI><a href="monad.html#sect20.4">20.4<tt> </tt>Library <tt>Monad</tt></a>
<LI><a href="io.html#sect21">21<tt> </tt>Input/Output</a>
<LI><a href="io.html#sect21.1">21.1<tt> </tt>I/O Errors</a>
<LI><a href="io.html#sect21.2">21.2<tt> </tt>Files and Handles</a>
<LI><a href="io.html#sect21.2.1">21.2.1<tt> </tt>Standard Handles</a>
<LI><a href="io.html#sect21.2.2">21.2.2<tt> </tt>Semi-Closed Handles</a>
<LI><a href="io.html#sect21.2.3">21.2.3<tt> </tt>File locking</a>
<LI><a href="io.html#sect21.3">21.3<tt> </tt>Opening and Closing Files</a>
<LI><a href="io.html#sect21.3.1">21.3.1<tt> </tt>Opening Files</a>
<LI><a href="io.html#sect21.3.2">21.3.2<tt> </tt>Closing Files</a>
<LI><a href="io.html#sect21.4">21.4<tt> </tt>Determining the Size of a File</a>
<LI><a href="io.html#sect21.5">21.5<tt> </tt>Detecting the End of Input</a>
<LI><a href="io.html#sect21.6">21.6<tt> </tt>Buffering Operations</a>
<LI><a href="io.html#sect21.6.1">21.6.1<tt> </tt>Flushing Buffers</a>
<LI><a href="io.html#sect21.7">21.7<tt> </tt>Repositioning Handles</a>
<LI><a href="io.html#sect21.7.1">21.7.1<tt> </tt>Revisiting an I/O Position</a>
<LI><a href="io.html#sect21.7.2">21.7.2<tt> </tt>Seeking to a new Position</a>
<LI><a href="io.html#sect21.8">21.8<tt> </tt>Handle Properties</a>
<LI><a href="io.html#sect21.9">21.9<tt> </tt>Text Input and Output</a>
<LI><a href="io.html#sect21.9.1">21.9.1<tt> </tt>Checking for Input</a>
<LI><a href="io.html#sect21.9.2">21.9.2<tt> </tt>Reading Input</a>
<LI><a href="io.html#sect21.9.3">21.9.3<tt> </tt>Reading Ahead</a>
<LI><a href="io.html#sect21.9.4">21.9.4<tt> </tt>Reading The Entire Input</a>
<LI><a href="io.html#sect21.9.5">21.9.5<tt> </tt>Text Output</a>
<LI><a href="io.html#sect21.10">21.10<tt> </tt>Examples</a>
<LI><a href="io.html#sect21.10.1">21.10.1<tt> </tt>Summing Two Numbers</a>
<LI><a href="io.html#sect21.10.2">21.10.2<tt> </tt>Copying Files</a>
<LI><a href="io.html#sect21.11">21.11<tt> </tt>Library <tt>IO</tt></a>
<LI><a href="directory.html#sect22">22<tt> </tt>Directory Functions</a>
<LI><a href="system.html#sect23">23<tt> </tt>System Functions</a>
<LI><a href="time.html#sect24">24<tt> </tt>Dates and Times</a>
<LI><a href="time.html#sect24.1">24.1<tt> </tt>Library <tt>Time</tt></a>
<LI><a href="locale.html#sect25">25<tt> </tt>Locale</a>
<LI><a href="locale.html#sect25.1">25.1<tt> </tt>Library <tt>Locale</tt></a>
<LI><a href="cputime.html#sect26">26<tt> </tt>CPU Time</a>
<LI><a href="random.html#sect27">27<tt> </tt>Random Numbers</a>
<LI><a href="random.html#sect27.1">27.1<tt> </tt>The <tt>RandomGen</tt> class, and the <tt>StdGen</tt> generator</a>
<LI><a href="random.html#sect27.2">27.2<tt> </tt>The <tt>Random</tt> class</a>
<LI><a href="random.html#sect27.3">27.3<tt> </tt>The global random number generator</a>
</UL>
|