|
Overview
- Slides of talk:
Purely Functional Algorithm Specification
Software Software
- Getting Started With Haskell: GS.hs
- Talking about Mathematical Objects: TAMO.hs
- The Guarded Command Language: GCL.hs
- Hoare Logic: Hoare.hs
- Greatest Common Divisor Algorithms: GCD.hs
- Graph Algorithms: GraphAlg.hs
The ghci Haskell interpreter needed to run these programs and modules is available from the Haskell homepage. Here is a gentle introduction to Haskell.
Home
Problems
- Test the specification of Prim's Algorithm from GraphAlg.hs with QuickCheck.
- Test the specification of Dijkstra's Shortest Path Algorithm from GraphAlg.hs with QuickCheck.
- Give an algorithm specification for QuickSort that uses arrays, and test it with QuickCheck.
- Give an algorithm specification of Kruskal's algorithm for minimum spanning tree, and test it with QuickCheck.
- Pick your choice from the following
list of
algorithms, specify and test.
- For further problems and solutions please get in touch with Jan van Eijck.
Courses
Software testing, Master Programme Software Engineering, University of Amsterdam.
Home