forked from wimvanderbauwhede/HaskellMOOC
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCourse-overview.lyx
572 lines (452 loc) · 8.05 KB
/
Course-overview.lyx
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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
#LyX 2.1 created this file. For more info see http://www.lyx.org/
\lyxformat 474
\begin_document
\begin_header
\textclass article
\use_default_options true
\maintain_unincluded_children false
\language english
\language_package default
\inputencoding auto
\fontencoding global
\font_roman default
\font_sans default
\font_typewriter default
\font_math auto
\font_default_family default
\use_non_tex_fonts false
\font_sc false
\font_osf false
\font_sf_scale 100
\font_tt_scale 100
\graphics default
\default_output_format default
\output_sync 0
\bibtex_command default
\index_command default
\paperfontsize default
\use_hyperref false
\papersize default
\use_geometry false
\use_package amsmath 1
\use_package amssymb 1
\use_package cancel 1
\use_package esint 1
\use_package mathdots 1
\use_package mathtools 1
\use_package mhchem 1
\use_package stackrel 1
\use_package stmaryrd 1
\use_package undertilde 1
\cite_engine basic
\cite_engine_type default
\biblio_style plain
\use_bibtopic false
\use_indices false
\paperorientation portrait
\suppress_date false
\justification true
\use_refstyle 1
\index Index
\shortcut idx
\color #008000
\end_index
\secnumdepth 3
\tocdepth 3
\paragraph_separation indent
\paragraph_indentation default
\quotes_language english
\papercolumns 1
\papersides 1
\paperpagestyle default
\tracking_changes false
\output_changes false
\html_math_output 0
\html_css_as_file 0
\html_be_strict false
\end_header
\begin_body
\begin_layout Title
Introduction to Functional Programming in Haskell -- Course Overview
\end_layout
\begin_layout Section*
L1.0 Introduction
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
The
\begin_inset Quotes eld
\end_inset
Introduction to Functional Programming in Haskell
\begin_inset Quotes erd
\end_inset
course
\end_layout
\begin_layout Enumerate
Programming paradigms
\end_layout
\begin_layout Enumerate
Functional Languages
\end_layout
\begin_layout Section*
L1.1 Expressions and Equations
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Enumerate
Expressions
\end_layout
\begin_layout Enumerate
Equations
\end_layout
\begin_layout Section*
L1.2 Reduction, Functions, and Lists
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Enumerate
Reduction
\end_layout
\begin_layout Enumerate
Functions
\end_layout
\begin_deeper
\begin_layout Itemize
Function definitions
\end_layout
\begin_layout Itemize
Function application
\end_layout
\begin_layout Itemize
Multiple arguments and results
\end_layout
\end_deeper
\begin_layout Enumerate
Lists
\end_layout
\begin_deeper
\begin_layout Itemize
Constructing lists
\end_layout
\begin_layout Itemize
Operating on lists
\end_layout
\end_deeper
\begin_layout Section*
L2.1 Text Input/Output
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
Practical Functional programming
\end_layout
\begin_layout Enumerate
Some basic techniques
\end_layout
\begin_deeper
\begin_layout Itemize
Layout
\end_layout
\begin_layout Itemize
Some standard functions
\end_layout
\begin_layout Itemize
Conditional expressions
\end_layout
\end_deeper
\begin_layout Enumerate
Input/output
\end_layout
\begin_layout Enumerate
The Starman program
\end_layout
\begin_deeper
\begin_layout Itemize
Calculating the result
\end_layout
\end_deeper
\begin_layout Enumerate
Interaction with game player
\end_layout
\begin_layout Section*
L2.2 Computations and Polymorphism
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
Computations
\end_layout
\begin_deeper
\begin_layout Itemize
Running Starman
\end_layout
\begin_layout Itemize
IO operations
\end_layout
\begin_layout Itemize
Using let in a monad
\end_layout
\begin_layout Itemize
show and read
\end_layout
\end_deeper
\begin_layout Enumerate
Polymorphic types
\end_layout
\begin_layout Enumerate
Using ghci
\end_layout
\begin_layout Section*
L3.1 Data Structures
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Itemize
Recursion on lists
\end_layout
\begin_layout Itemize
filter
\end_layout
\begin_layout Itemize
Computations over lists
\end_layout
\begin_layout Itemize
map
\end_layout
\begin_layout Itemize
foldl
\end_layout
\begin_layout Itemize
foldr
\end_layout
\begin_layout Section*
L3.2 Computations and Types
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
IO Operations
\end_layout
\begin_deeper
\begin_layout Itemize
Computations
\end_layout
\begin_layout Itemize
Using let in a monad
\end_layout
\begin_layout Itemize
show and read
\end_layout
\end_deeper
\begin_layout Enumerate
Algebraic data types
\end_layout
\begin_deeper
\begin_layout Itemize
Deriving Show and Read
\end_layout
\begin_layout Itemize
Recursion over a tree
\end_layout
\end_deeper
\begin_layout Section
L3.3 Equational Reasoning [optional extra]
\end_layout
\begin_layout Itemize
Equational Reasoning
\end_layout
\begin_layout Section*
L4.1 Returning Functions as Values – Parsing
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Itemize
Returning functions as values
\end_layout
\begin_layout Itemize
Function generators
\end_layout
\begin_layout Itemize
Structuring a program
\end_layout
\begin_layout Itemize
Parsing text
\end_layout
\begin_layout Itemize
Parsec: monadic parsing combinators
\end_layout
\begin_layout Section*
L4.2 Program Structure
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
Scoping
\end_layout
\begin_deeper
\begin_layout Itemize
let expressions
\end_layout
\begin_layout Itemize
where clauses
\end_layout
\end_deeper
\begin_layout Enumerate
Conditionals
\end_layout
\begin_deeper
\begin_layout Itemize
Guards
\end_layout
\begin_layout Itemize
Constructors and case expressions
\end_layout
\end_deeper
\begin_layout Enumerate
Maybe
\end_layout
\begin_layout Enumerate
Documentation
\end_layout
\begin_layout Section*
L5.1 Strictness
\end_layout
\begin_layout Standard
JS
\end_layout
\begin_layout Enumerate
Strictness
\end_layout
\begin_layout Enumerate
Data recursion
\end_layout
\begin_deeper
\begin_layout Itemize
Fibonacci numbers
\end_layout
\begin_layout Itemize
Modularity and infinite data structures
\end_layout
\end_deeper
\begin_layout Enumerate
Advice on structuring a program
\end_layout
\begin_layout Enumerate
Real world parsing examples
\end_layout
\begin_layout Enumerate
Unassessed exercises
\end_layout
\begin_layout Section*
L5.2 Types
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Enumerate
Function types
\end_layout
\begin_deeper
\begin_layout Itemize
Lambda expressions
\end_layout
\begin_layout Itemize
Monomorphic functions
\end_layout
\begin_layout Itemize
Polymorphic functions
\end_layout
\begin_layout Itemize
Currying
\end_layout
\begin_layout Itemize
Type classes
\end_layout
\end_deeper
\begin_layout Enumerate
Type inference
\end_layout
\begin_layout Section*
L6.1 Type classes and Lambda Calculus
\end_layout
\begin_layout Standard
WV
\end_layout
\begin_layout Enumerate
Defining type classes
\end_layout
\begin_deeper
\begin_layout Itemize
Class and instance declarations
\end_layout
\begin_layout Itemize
The Num class
\end_layout
\begin_layout Itemize
The Show class
\end_layout
\begin_layout Itemize
More standard typeclasses
\end_layout
\end_deeper
\begin_layout Enumerate
Introduction to Lambda Calculus
\end_layout
\begin_layout Section*
L6.2 Monads
\end_layout
\begin_layout Standard
JS+WV
\end_layout
\begin_layout Enumerate
Monads
\end_layout
\begin_deeper
\begin_layout Itemize
Building blocks
\end_layout
\begin_layout Itemize
Type class
\end_layout
\begin_layout Itemize
Laws
\end_layout
\end_deeper
\begin_layout Enumerate
The Maybe Monad
\end_layout
\begin_deeper
\begin_layout Itemize
The Maybe type constructor
\end_layout
\begin_layout Itemize
Monad instance of Maybe
\end_layout
\begin_layout Itemize
A computation using explicit Maybe
\end_layout
\begin_layout Itemize
A computation using the Maybe monad
\end_layout
\begin_layout Itemize
Example: Reduction of bar [5,6]
\end_layout
\begin_layout Itemize
Example: Reduction of bar [5,6,7]
\end_layout
\begin_layout Itemize
do notation
\end_layout
\end_deeper
\end_body
\end_document