Introduction to programming using SML

Content: 1.1 Values, types, identifiers and declarations 2 --
1.2 Simple function declarations 3 --
1.4 Recursion 5 --
1.5 The power function 10 --
1.6 About types and type checking 11 --
1.7 Bindings and environments 12 --
2 Basic values and operators 15 --
2.1 Integers and reals 15 --
2.2 Expressions, precedence, association 17 --
2.3 Euclid's algorithm 18 --
2.4 Evaluations with environments 20 --
2.5 Characters and strings 22 --
2.6 Truth values 25 --
2.7 The if-then-else expression 26 --
2.8 Overloaded operators 27 --
2.9 Type inference 27 --
3 Tuples and records 31 --
3.1 Tuples 31 --
3.2 Tuple patterns 34 --
3.3 Infix functions on pairs 35 --
3.4 Records 39 --
3.5 Record patterns 40 --
3.6 Type declarations 41 --
3.7 Locally declared identifiers 44 --
4 Problem solving I 49 --
4.1 Problem statement: rational numbers 50 --
4.2 Solution 1 50 --
4.3 Solution 2 55 --
4.4 Comparing the solutions 56 --
4.5 A solution using records 58 --
5 Lists 60 --
5.1 Building lists 61 --
5.2 The 'cons' operator 63 --
5.3 List patterns 66 --
5.4 Append and reverse
 polymorphic types 69 --
5.5 Polymorphic values 72 --
5.6 A library of list functions 73 --
5.7 Membership
 equality types 76 --
5.8 Type inference 78 --
6 Problem solving II 83 --
6.1 Problem analysis: cash register 83 --
6.2 Programming 85 --
6.3 Test 87 --
7 Tagged values and partial functions 90 --
7.1 Datatype declarations 91 --
7.2 The case-expression 92 --
7.3 Enumeration types 94 --
7.4 The order type 95 --
7.5 Partial functions: the option datatype 95 --
7.6 Exception handling 98 --
7.7 The Eight Queens problem 100 --
8 Finite trees 104 --
8.1 Chinese boxes 104 --
8.2 Symbolic differentiation 112 --
8.3 Trees of ancestors
 traversal of a tree 117 --
8.4 Mutual recursion 120 --
8.5 Parameterized datatypes 123 --
8.6 Electrical circuits 124 --
8.7 Abstract types 125 --
9 Higher-order functions 135 --
9.1 Expressions denoting functions 136 --
9.2 Value declarations of recursive functions 138 --
9.3 The map function 139 --
9.4 Declaring higher order functions 141 --
9.5 Higher-order list functions 142 --
9.6 Functional composition 149 --
9.7 Tree recursion 150 --
9.8 Type inference for higher-order functions 151 --
9.9 Closures 152 --
9.10 Static binding 156 --
9.11 Lazy evaluation 157 --
10 Finite sets 161 --
10.1 A representation of sets 161 --
10.2 Operations on sets 162 --
10.3 An abstype for sets 165 --
10.4 Other representations of sets 169 --
11 Modules 174 --
11.1 Structures 175 --
11.2 Specifications and signatures 176 --
11.3 Signatures and structures 177 --
11.4 Further facilities 181 --
11.5 Fixity of identifiers 183 --
11.6 Functors 184 --
12.1 The table concept 194 --
12.2 A representation of tables 195 --
12.3 Operations on tables 195 --
13 Problem solving III 205 --
13.1 Problem analysis 206 --
13.2 A sample run 208 --
13.3 Programming 209 --
13.4 Test 214 --
14 Input/output in SML 217 --
14.1 Input streams 217 --
14.2 Output streams 219 --
14.3 Simple input and output 220 --
14.4 Use of conversions 223 --
14.5 Sequential composition 225 --
14.6 Input/output of composite data 226 --
14.7 Input with prompt and validation 228 --
15 Interactive programs 230 --
15.1 A quiz program 230 --
15.2 Actions 231 --
15.3 Action schemas 231 --
15.4 Functions for action schemas 232 --
15.5 Dialogue automaton 233 --
15.6 Dialogue program 235 --
15.7 Action refinement 236 --
16 Problem solving IV 241 --
16.1 Problem analysis 241 --
16.2 Programming 247 --
16.3 Test 250 --
17 Iteration 253 --
17.1 Resource measures 253 --
17.2 Two problems 254 --
17.3 Solutions: accumulating parameters 255 --
17.4 Iteration 257 --
18 Imperative programming 263 --
18.1 The store 264 --
18.2 Operations on the SML store 264 --
18.3 References and polymorphism 268 --
18.4 Arrays 269 --
18.5 The while loop 277 --
18.6 Imperative data structures 280 --
A SML systems 284 --
B Overview of Standard ML 285 --
B.1 Lexical conventions 286 --
B.2 Syntax 288 --
B.3 Value, environment and store 292 --
B.4 Types 295 --
B.5 Semantics 296 --
C Overview of the SML module system 306 --
C.1 Lexical conventions 306 --
C.2 Syntax 307 --
C.3 Interfaces and environments 308 --
C.4 Semantics 308 --
D Selected parts of the SML basis library 313 --
D.1 General 314 --
D.2 Numbers 317 --
D.3 Characters and strings 320 --
D.4 Lists 324 --
D.5 Vectors 326 --
D.6 Arrays 327 --
D.7 Timers and time 329 --
D.8 Date 330 --
D.9 Conversions 330 --
D.10 Text input 335 --
D.11 Text output 336 --
E Modules of sets and tables 338 --
E.1 Sets 339 --
E.2 Tables 339 --
E.3 Signatures 341 --
E.4 Structures 342 --
F The ASCII alphabet 346.