ML for the Working Programmer, 2nd Edition

Sample programs, by chapter

• DISCLAIMER OF WARRANTY -- please read
• Notes on Compatibility
• Root file to load all the others in order
• Chapter 2: records, Fibonacci numbers, square roots, complex numbers (using modules)
• Chapter 3: making change, binary arithmetic, matrix operations, Dijkstra's problems, graph algorithms, sorting, polynomial arithmetic. (Pre-1998 version)
• Chapter 4: trees, dictionaries, functional arrays, priority queues, tautology checker
• Chapter 5: functions as values, lazy lists, search strategies
• Chapter 7: queue structures, abstype examples, matrix operations functor, dictionary functor
• Chapter 8: lazy lists using references, ring buffers, V-arrays, input/output, pretty printing (Pre-1998 version)
• Chapter 9: scanning and parsing primitives, their application to types, lambda-calculus reducer, examples
• Chapter 10: tactic-based prover for first-order logic, with separate test data (Pre-1998 version)

Back to ML for the Working Programmer, main page