# Blog articles/Testing

### From HaskellWiki

< Blog articles(Difference between revisions)

DonStewart (Talk | contribs) (→Type checking for correctness) |
DonStewart (Talk | contribs) (→Coq) |
||

Line 32: | Line 32: | ||

* [http://www.rubrication.net/2007/04/24/strong-specifications/ Strong specifications in Coq: the type says everything] | * [http://www.rubrication.net/2007/04/24/strong-specifications/ Strong specifications in Coq: the type says everything] | ||

+ | * Proving the monad laws in Coq | ||

+ | ** [http://sequence.complete.org/node/358 Introduction] | ||

+ | ** [http://sequence.complete.org/node/359 The First and Second Laws] | ||

+ | ** [http://sequence.complete.org/node/360 The Third Law] | ||

=== Isabelle=== | === Isabelle=== |

## Revision as of 00:30, 24 September 2007

## Contents |

## 1 Type system enforcement

## 2 Testing, correctness and proofs

### 2.1 QuickCheck

- Introduction to QuickCheck
- QuickChecking a window manager
- Robustness and QuickCheck
- Parsec Parser Testing with QuickCheck
- QuickCheck : Why Testing code should be Laissez-faire

### 2.2 HUnit

### 2.3 Catch

- Does XMonad crash? On proving pattern coverage with Catch
- Preconditions on XMonad
- Equational Reasoning in Haskell

## 3 Proofs

### 3.1 GADTs

### 3.2 Coq

- Strong specifications in Coq: the type says everything
- Proving the monad laws in Coq

### 3.3 Isabelle

### 3.4 Related work

- See the section on theorem provers