Skip to content

Commit 8cd798f

Browse files
authored
Fix typos (#23)
Signed-off-by: Samuel Tyler <samuel@samuelt.me>
1 parent 1a772f7 commit 8cd798f

2 files changed

Lines changed: 3 additions & 3 deletions

File tree

src/language-top.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -85,7 +85,7 @@ domain Pair[A, B] {
8585
* Declared by keyword `domain`
8686
* Have a name, which is introduced as an additional _type_ in the Viper program
8787
* Domains may have type parameters (e.g. `A` and `B` above)
88-
* A domain's body (delimited by braces) consists of a number function declarations, followed by a number of axioms
88+
* A domain's body (delimited by braces) consists of a number of function declarations, followed by a number of axioms
8989
* Domain functions (functions declared inside a `domain`) may have neither a body nor a specification; these are uninterpreted total mathematical functions
9090
* Domain axioms consist of name (following the `axiom` keyword), and a definition enclosed within braces (which is a boolean expression which may not read the program state in any way)
9191
* Useful for specifying custom mathematical theories
@@ -106,7 +106,7 @@ define link(x, y) {
106106
* Macros are not type-checked until after expansion
107107
* However, macro bodies must be well-formed assertions / statements
108108
* May have any number of (untyped) parameter names (e.g. `a` and `b` above)
109-
* The are two kinds of macros
109+
* There are two kinds of macros
110110
* Macros defining assertions (or expressions) include the macro definition whitespace-separated afterwards (e.g. `plus` above)
111111
* Macros defining _statements_ include their definitions within braces (e.g. `link` above)
112112
* See the [array domain encoding](./domains-array.md) for an example

src/termination-measures.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ Viper successfully verifies that `factorial` terminates: at each recursive invoc
2727

2828
Viper's standard library provides definitions of well-founded orders for most types built into Viper, all of which can be imported from the `decreases` folder. The following table lists all provided orders; we write `s1 <_ s2` if `s1` is less than `s2` with respect to the order.
2929

30-
| Build-In Type<br>(file name) | Provided Well-Founded Order |
30+
| Built-In Type<br>(file name) | Provided Well-Founded Order |
3131
| ---- | ---- |
3232
|`Ref`<br>(`ref.vpr`)| `r1 <_ r2 <==> r1 == null && r2 != null`
3333
|`Bool`<br>(`bool.vpr`)| `b1 <_ b2 <==> b1 == false && b2 == true`

0 commit comments

Comments
 (0)