diff options
| author | Helmut Grohne <grohne@cs.uni-bonn.de> | 2014-01-27 09:02:45 +0100 |
|---|---|---|
| committer | Helmut Grohne <grohne@cs.uni-bonn.de> | 2014-01-27 09:02:45 +0100 |
| commit | d2521627834713a651be0ac22aab0a1cd78df920 (patch) | |
| tree | 0dcc208b6b824af20f4f7971dcaeb14d1d5ebdb2 /Bidir.agda | |
| parent | 2d7db0d8c48c41ecef78ef9f18253632a80f4710 (diff) | |
| download | bidiragda-d2521627834713a651be0ac22aab0a1cd78df920.tar.gz | |
prove assoc-enough in the presence of delete
The old definition of bff had a single failure mode - assoc - and its
proof was a single cong. Now we need to show that the other failure mode
- mapM (flip lookupM ...) - is eliminated by the success of the former
resulting in a larger proof.
Diffstat (limited to 'Bidir.agda')
0 files changed, 0 insertions, 0 deletions