Revision
When it comes to revision the following table may help you out:
Lecture | Title | Topics |
---|---|---|
1 | Intro to Programming | numeric types and operations, if-then-else construct, val and fun |
2 | Recursion & Efficiency | recursion and iteration, big O notation, recurrence relations |
3 | Lists | syntax for lists, strings & characters, pattern matching |
4 | More on Lists | equality polymorphism, wildcard pattern, making change example, local declaration |
5 | Sorting | insert sort, quicksort, merge sort, |
6 | Datatypes & trees | enum and datatype, exceptions, binary trees, |
7 | Dictionaries & Functional Arrays | dictonaries, functional arrays |
8 | Functions as values | first class functions, anonymous functions, curried function & partial application, matrix multiplication |
9 | Sequences or Lazy lists | lazy lists, |
10 | Queues & Search Strategies | DFS, SFS, queues, case notation, iterative deepening, stacks |
11 | Polynomial Arithmetic | data structure of polynomials, basic polynomial ops, GCD |
12 | Procedural Programming | references in ML, commands & sequencing, while, arrays |
Resources
http://www.polyml.org/index.html – PolyML homepage
http://www.cl.cam.ac.uk/teaching/1415/FoundsCS/ – course webpage
http://www.amazon.co.uk/ML-Working-Programmer-Larry-Paulson/dp/052156543X – course textbook on amazon
ML course notes (from universities around the web)
http://www.soc.napier.ac.uk/course-notes/sml/ – sml course notes for napier
http://www.cs.cmu.edu/~rwh/smlbook/book.pdf – book on programming in SML by Robert Harper at CMU
http://www.cs.cmu.edu/afs/cs/academic/class/15814-f03/www/sml-intro.pdf – slides for intro to SML at CMU
http://www.cs.cmu.edu/~rwh/introsml/contents.htm – course notes to go alongside the slides for intro to SML at CMU
If you have any difficulties or questions, do not hesitate to contact me.