Commit 40441970 by Michael Hanus

### Names of proof files changed so that module names are included

parent a7704c48
 ... @@ -661,7 +661,7 @@ sort'post xs ys = length xs == length ys ... @@ -661,7 +661,7 @@ sort'post xs ys = length xs == length ys -- Specification: -- Specification: -- A correct result is a permutation of the input which is sorted. -- A correct result is a permutation of the input which is sorted. sort'spec :: [Int] -> [Int] sort'spec :: [Int] -> [Int] sort'spec xs | ys == perm xs && sorted ys = ys where ys free sort'spec xs | sorted ys = ys where ys = perm xs -- An implementation of sort with quicksort: -- An implementation of sort with quicksort: sort :: [Int] -> [Int] sort :: [Int] -> [Int] ... ...
 module Proof-last-is-deterministic where module Proof-DetOps-last-is-deterministic where -- Show that last is a deterministic operation. -- Show that last is a deterministic operation. -- The property to show is: -- The property to show is: ... ...
 ... @@ -2,7 +2,7 @@ ... @@ -2,7 +2,7 @@ open import bool open import bool module PROOF-appendAddLengths module PROOF-ListProp-appendAddLengths (Choice : Set) (Choice : Set) (choose : Choice → 𝔹) (choose : Choice → 𝔹) (lchoice : Choice → Choice) (lchoice : Choice → Choice) ... ...
 ... @@ -2,7 +2,7 @@ ... @@ -2,7 +2,7 @@ open import bool open import bool module PROOF-sortPreservesLength module PROOF-SortSpec-sortPreservesLength (Choice : Set) (Choice : Set) (choose : Choice → 𝔹) (choose : Choice → 𝔹) (lchoice : Choice → Choice) (lchoice : Choice → Choice) ... ...