diff options
| author | letouzey | 2011-09-22 17:46:03 +0000 |
|---|---|---|
| committer | letouzey | 2011-09-22 17:46:03 +0000 |
| commit | 5764048ae328e8ebe058baf58ce18a2bcaf5e27e (patch) | |
| tree | d8f8555f8a9a7a5d9f384b58667c8127720ebe13 | |
| parent | d3af0bfac87e977dbefddda8408a9367d536bc52 (diff) | |
Fix test-suite for s/Defining '\1' as keyword/Identifier '\1' now a keyword/.
Signed-off-by: Tom Prince <tom.prince@ualberta.net>
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@14484 85f007b7-540e-0410-9357-904b9bb8a0f7
| -rw-r--r-- | test-suite/output/Notations.out | 14 | ||||
| -rw-r--r-- | test-suite/output/Notations2.out | 2 |
2 files changed, 8 insertions, 8 deletions
diff --git a/test-suite/output/Notations.out b/test-suite/output/Notations.out index 72264d082b..ada524f1c9 100644 --- a/test-suite/output/Notations.out +++ b/test-suite/output/Notations.out @@ -2,10 +2,10 @@ true ? 0; 1 : nat if true as x return (x ? nat; bool) then 0 else true : nat -Defining 'proj1' as keyword +Identifier 'proj1' now a keyword fun e : nat * nat => proj1 e : nat * nat -> nat -Defining 'decomp' as keyword +Identifier 'decomp' now a keyword decomp (true, true) as t, u in (t, u) : bool * bool !(0 = 0) @@ -28,18 +28,18 @@ forall n n0 : nat, ###(n = n0) : list nat (1; 2, 4) : nat * nat * nat -Defining 'ifzero' as keyword +Identifier 'ifzero' now a keyword ifzero 3 : bool -Defining 'pred' as keyword +Identifier 'pred' now a keyword pred 3 : nat fun n : nat => pred n : nat -> nat fun n : nat => pred n : nat -> nat -Defining 'ifn' as keyword -Defining 'is' as keyword +Identifier 'ifn' now a keyword +Identifier 'is' now a keyword fun x : nat => ifn x is succ n then n else 0 : nat -> nat 1- @@ -80,7 +80,7 @@ Nil : forall A : Type, list A NIL:list nat : list nat -Defining 'I' as keyword +Identifier 'I' now a keyword (false && I 3)%bool /\ I 6 : Prop [|1, 2, 3; 4, 5, 6|] diff --git a/test-suite/output/Notations2.out b/test-suite/output/Notations2.out index d92f8d6946..ffe064e7b8 100644 --- a/test-suite/output/Notations2.out +++ b/test-suite/output/Notations2.out @@ -30,7 +30,7 @@ let d := 2 in ∃ z : nat, let e := 3 in let f := 4 in x + y = z + d : Type -> Prop λ A : Type, ∀ n p : A, n = p : Type -> Prop -Defining 'let'' as keyword +Identifier 'let'' now a keyword let' f (x y : nat) (a:=0) (z : nat) (_ : bool) := x + y + z + 1 in f 0 1 2 : bool -> nat λ (f : nat -> nat) (x : nat), f(x) + S(x) |