|
|
COMP2600: Formal Methods for Software Engineering
The 2008 Archive
Lecture Slides and Supporting Material
- Revision: Propositional Logic, Predicate Calculus
Week 1, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Revision: Sets, Functions, Relations, Induction
Week 1, Wednesday
Slides:
[pdf]
[pdf 2×2]
- Revision: Basic Haskell
Week 2, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Natural Deduction
Week 2, Wednesday
Slides:
[pdf]
[pdf 2×2]
- Natural Deduction (continued)
Week 2, Friday
Slides:
[pdf]
[pdf 2×2]
- Soundness, Completeness and Consistency
Week 3, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Types and Recursion
Week 3, Wednesday
Slides:
[pdf]
[pdf 2×2]
Example code:
[Expression.hs]
- Structural Induction
Week 3, Friday
Slides:
[pdf]
[pdf 2×2]
- Structural Induction (continued)
Week 4, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Hoare Logic
Week 4, Wednesday & Friday; Week 5, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Weakest Preconditions
Week 5, Wednesday & Friday; Week 6, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Lambda Calculus
Week 6, Wednesday
Slides:
[pdf]
[pdf 2×2]
- Church Encoding
Week 6, Friday
Slides:
[pdf]
[pdf 2×2]
- Type Checking
Week 7, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Finite State Automata & Regular Languages
Week 8, Tuesday, Wednesday and Friday
Slides:
[pdf]
[pdf 2×2]
- Language and Grammars
Week 9, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Push-Down Automata
Week 9, Wednesday
Slides:
[pdf]
[pdf 2×2]
- Introduction to Parsing
Week 9, Wednesday
Slides:
[pdf]
[pdf 2×2]
Example code:
[ParseTypeDefs.hs]
[Expression Evaluator]
- Turing Machines
Week 10, Tuesday
Slides:
[pdf]
[pdf 2×2]
- Prolog
Week 10, Wednesday
Slides:
[pdf]
[pdf 2×2]
Example code:
[facts.pl]
[likes.pl]
[parent.pl]
[parse.pl]
- Complexity and Computability
Week 10, Friday
Slides:
[pdf]
[pdf×2]
|
