mirror of
https://github.com/achlipala/frap.git
synced 2024-11-10 00:07:51 +00:00
Typo fixes
This commit is contained in:
parent
49b23293ca
commit
256995f1dd
2 changed files with 11 additions and 9 deletions
|
@ -29,7 +29,7 @@ Set Implicit Arguments.
|
|||
* implementations freedom in internal details. *)
|
||||
Module Algebraic.
|
||||
(* Here's an example of an algebraic interface or *specification* ("spec" for
|
||||
* short). It's for purely function queues, which follow first-in-first-out
|
||||
* short). It's for purely functional queues, which follow first-in-first-out
|
||||
* disciplines. *)
|
||||
Module Type QUEUE.
|
||||
Parameter t : Set -> Set.
|
||||
|
@ -619,7 +619,8 @@ Module AlgebraicWithEquivalenceRelation.
|
|||
simplify.
|
||||
rewrite app_nil_r in H.
|
||||
rewrite <- H in Heq1.
|
||||
rewrite rev_app_distr in Heq1. rewrite rev_app_distr in Heq1.
|
||||
rewrite rev_app_distr in Heq1.
|
||||
rewrite rev_app_distr in Heq1.
|
||||
simplify.
|
||||
invert Heq1.
|
||||
rewrite rev_involutive.
|
||||
|
@ -1178,7 +1179,7 @@ End SET_WITH_EQUALITY.
|
|||
(* Here's a generic implementation of finite sets, parameterized over an
|
||||
* arbitrary set with a correct equality operation. Note the use of the [with]
|
||||
* operator to *refine* the result signature [FINITE_SET]: we reveal that the
|
||||
* [key] type is actually [SE.T], that is the key type from the parameter module
|
||||
* [key] type is actually [SE.T], that is, the key type from the parameter module
|
||||
* [SE]. *)
|
||||
Module ListSet(SE : SET_WITH_EQUALITY) <: FINITE_SET with Definition key := SE.t.
|
||||
Definition key := SE.t.
|
||||
|
@ -1749,5 +1750,5 @@ Fixpoint upto (n : nat) : list nat :=
|
|||
|
||||
Compute upto 10.
|
||||
|
||||
Compute NatDuplicateFinder.noDuplicates (upto 1000).
|
||||
Compute FasterNatDuplicateFinder.noDuplicates (upto 1000).
|
||||
Time Compute NatDuplicateFinder.noDuplicates (upto 1000).
|
||||
Time Compute FasterNatDuplicateFinder.noDuplicates (upto 1000).
|
||||
|
|
|
@ -11,7 +11,7 @@ Set Implicit Arguments.
|
|||
* implementations freedom in internal details. *)
|
||||
Module Algebraic.
|
||||
(* Here's an example of an algebraic interface or *specification* ("spec" for
|
||||
* short). It's for purely function queues, which follow first-in-first-out
|
||||
* short). It's for purely functional queues, which follow first-in-first-out
|
||||
* disciplines. *)
|
||||
Module Type QUEUE.
|
||||
Parameter t : Set -> Set.
|
||||
|
@ -463,7 +463,8 @@ Module AlgebraicWithEquivalenceRelation.
|
|||
simplify.
|
||||
rewrite app_nil_r in H.
|
||||
rewrite <- H in Heq1.
|
||||
rewrite rev_app_distr in Heq1. rewrite rev_app_distr in Heq1.
|
||||
rewrite rev_app_distr in Heq1.
|
||||
rewrite rev_app_distr in Heq1.
|
||||
simplify.
|
||||
invert Heq1.
|
||||
rewrite rev_involutive.
|
||||
|
@ -1557,5 +1558,5 @@ Fixpoint upto (n : nat) : list nat :=
|
|||
|
||||
Compute upto 10.
|
||||
|
||||
Compute NatDuplicateFinder.noDuplicates (upto 1000).
|
||||
Compute FasterNatDuplicateFinder.noDuplicates (upto 1000).*)
|
||||
Time Compute NatDuplicateFinder.noDuplicates (upto 1000).
|
||||
Time Compute FasterNatDuplicateFinder.noDuplicates (upto 1000).*)
|
||||
|
|
Loading…
Reference in a new issue