diff options
| -rw-r--r-- | Binaries/DafnyPrelude.bpl | 4 | ||||
| -rw-r--r-- | Test/dafny0/BQueue.bpl | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/Binaries/DafnyPrelude.bpl b/Binaries/DafnyPrelude.bpl index 06b33b86..60de3d84 100644 --- a/Binaries/DafnyPrelude.bpl +++ b/Binaries/DafnyPrelude.bpl @@ -134,7 +134,7 @@ axiom (forall<T> s0: Seq T, s1: Seq T, n: int :: { Seq#SameUntil(s0,s1,n) } (forall j: int :: { Seq#Index(s0,j) } { Seq#Index(s1,j) }
0 <= j && j < n ==> Seq#Index(s0,j) == Seq#Index(s1,j)));
-function Seq#Take<T>(Seq T, howMany: int) returns (Seq T);
+function Seq#Take<T>(s: Seq T, howMany: int) returns (Seq T);
axiom (forall<T> s: Seq T, n: int :: { Seq#Length(Seq#Take(s,n)) }
0 <= n ==>
(n <= Seq#Length(s) ==> Seq#Length(Seq#Take(s,n)) == n) &&
@@ -143,7 +143,7 @@ axiom (forall<T> s: Seq T, n: int, j: int :: { Seq#Index(Seq#Take(s,n), j) } 0 <= j && j < n && j < Seq#Length(s) ==>
Seq#Index(Seq#Take(s,n), j) == Seq#Index(s, j));
-function Seq#Drop<T>(Seq T, howMany: int) returns (Seq T);
+function Seq#Drop<T>(s: Seq T, howMany: int) returns (Seq T);
axiom (forall<T> s: Seq T, n: int :: { Seq#Length(Seq#Drop(s,n)) }
0 <= n ==>
(n <= Seq#Length(s) ==> Seq#Length(Seq#Drop(s,n)) == Seq#Length(s) - n) &&
diff --git a/Test/dafny0/BQueue.bpl b/Test/dafny0/BQueue.bpl index 21c1c58a..77f1efb3 100644 --- a/Test/dafny0/BQueue.bpl +++ b/Test/dafny0/BQueue.bpl @@ -409,7 +409,7 @@ axiom (forall s0: Seq, s1: Seq :: { EqualSeq(s0,s1) } (forall j: int :: { Index(s0,j) } { Index(s1,j) }
0 <= j && j < Length(s0) ==> Index(s0,j) == Index(s1,j)));
-function Take(Seq, howMany: int) returns (Seq);
+function Take(s: Seq, howMany: int) returns (Seq);
axiom (forall s: Seq, n: int :: { Length(Take(s,n)) }
0 <= n ==>
(n <= Length(s) ==> Length(Take(s,n)) == n) &&
@@ -418,7 +418,7 @@ axiom (forall s: Seq, n: int, j: int :: { Index(Take(s,n), j) } 0 <= j && j < n && j < Length(s) ==>
Index(Take(s,n), j) == Index(s, j));
-function Drop(Seq, howMany: int) returns (Seq);
+function Drop(s: Seq, howMany: int) returns (Seq);
axiom (forall s: Seq, n: int :: { Length(Drop(s,n)) }
0 <= n ==>
(n <= Length(s) ==> Length(Drop(s,n)) == Length(s) - n) &&
|