lawspec 0.24.0 → 0.26.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (148) hide show
  1. package/CHANGELOG.md +109 -1
  2. package/README.md +34 -26
  3. package/UNICODE-LICENSE.txt +39 -0
  4. package/api.mjs +6 -23
  5. package/bin/lawspec.mjs +148 -65
  6. package/build.json +245 -177
  7. package/builtin-data-names.mjs +73 -0
  8. package/core.wasm +2 -2
  9. package/core_jsffi.js +5 -0
  10. package/examples/native-payments/clojure/lawspec.json +13 -2
  11. package/examples/native-payments/csharp/lawspec.json +13 -2
  12. package/examples/native-payments/elixir/lawspec.json +14 -3
  13. package/examples/native-payments/erlang/lawspec.json +14 -3
  14. package/examples/native-payments/fsharp/lawspec.json +14 -3
  15. package/examples/native-payments/gleam/lawspec.json +14 -3
  16. package/examples/native-payments/go/lawspec.json +14 -3
  17. package/examples/native-payments/groovy/lawspec.json +14 -3
  18. package/examples/native-payments/haskell/lawspec.json +14 -3
  19. package/examples/native-payments/java/lawspec.json +14 -3
  20. package/examples/native-payments/javascript/lawspec.json +14 -3
  21. package/examples/native-payments/kotlin/lawspec.json +14 -3
  22. package/examples/native-payments/python/lawspec.json +14 -3
  23. package/examples/native-payments/rust/lawspec.json +14 -3
  24. package/examples/native-payments/scala/lawspec.json +14 -3
  25. package/examples/native-payments/swift/lawspec.json +14 -3
  26. package/examples/native-payments/typescript/lawspec.json +14 -3
  27. package/examples/packages/orders/lawspec.json +25 -5
  28. package/examples/packages/orders/orders.lawspec +57 -53
  29. package/examples/packages/shop-domain/src/domain.lawspec +36 -33
  30. package/examples/packages/shop-tax-1/src/api.lawspec +1 -0
  31. package/examples/packages/shop-tax-1/src/rates.lawspec +5 -4
  32. package/examples/packages/shop-tax-2/src/api.lawspec +1 -0
  33. package/examples/packages/shop-tax-2/src/rates.lawspec +6 -4
  34. package/examples/rc1/authorization-snapshots.lawspec +113 -0
  35. package/examples/rc1/banner-filenames.lawspec +64 -0
  36. package/examples/rc1/bit-codec.lawspec +57 -0
  37. package/examples/rc1/bounded-witness-search.lawspec +151 -0
  38. package/examples/rc1/conflicting-requirements.lawspec +31 -0
  39. package/examples/rc1/constructive-witnesses.lawspec +120 -0
  40. package/examples/rc1/documentary-review.lawspec +43 -0
  41. package/examples/rc1/empty-domains.lawspec +47 -0
  42. package/examples/rc1/finite-integer-domains.lawspec +76 -0
  43. package/examples/rc1/law-metadata.lawspec +30 -0
  44. package/examples/rc1/native-payments.lawspec +108 -0
  45. package/examples/rc1/nesting/rrr.lawspec +34 -0
  46. package/examples/rc1/nesting/rru.lawspec +57 -0
  47. package/examples/rc1/nesting/rur.lawspec +58 -0
  48. package/examples/rc1/nesting/ruu.lawspec +78 -0
  49. package/examples/rc1/nesting/urr.lawspec +53 -0
  50. package/examples/rc1/nesting/uru.lawspec +73 -0
  51. package/examples/rc1/nesting/uur.lawspec +74 -0
  52. package/examples/rc1/nesting/uuu.lawspec +96 -0
  53. package/examples/rc1/order-workflow.lawspec +127 -0
  54. package/examples/rc1/parcel-measurements.lawspec +93 -0
  55. package/examples/rc1/picture-records.lawspec +52 -0
  56. package/examples/rc1/picture-tuples.lawspec +48 -0
  57. package/examples/rc1/record-payloads.lawspec +57 -0
  58. package/examples/rc1/recursive-records.lawspec +65 -0
  59. package/examples/rc1/refund-conformance.lawspec +45 -0
  60. package/examples/rc1/refund-policy.lawspec +89 -0
  61. package/examples/rc1/requirement-composition.lawspec +90 -0
  62. package/examples/rc1/structural-records.lawspec +54 -0
  63. package/examples/rc1-authoring.lawspec +57 -0
  64. package/examples/specs/abilities.lawspec +67 -65
  65. package/examples/specs/ability_imports.lawspec +58 -57
  66. package/examples/specs/actors.lawspec +23 -22
  67. package/examples/specs/algebra.lawspec +142 -141
  68. package/examples/specs/approvals.lawspec +16 -15
  69. package/examples/specs/async_bindings.lawspec +10 -9
  70. package/examples/specs/async_fetch.lawspec +12 -11
  71. package/examples/specs/atoi_codec.lawspec +16 -15
  72. package/examples/specs/boolean_flags.lawspec +10 -9
  73. package/examples/specs/builtins.lawspec +73 -72
  74. package/examples/specs/canonical_url.lawspec +14 -13
  75. package/examples/specs/collections.lawspec +153 -154
  76. package/examples/specs/composition.lawspec +70 -66
  77. package/examples/specs/concurrent_collections.lawspec +8 -7
  78. package/examples/specs/consistency.lawspec +4 -3
  79. package/examples/specs/contracts.lawspec +80 -79
  80. package/examples/specs/crypto.lawspec +26 -25
  81. package/examples/specs/ctc.lawspec +148 -0
  82. package/examples/specs/currying.lawspec +32 -31
  83. package/examples/specs/data_types.lawspec +50 -49
  84. package/examples/specs/distribution.lawspec +57 -56
  85. package/examples/specs/domain_modeling.lawspec +48 -47
  86. package/examples/specs/durations.lawspec +39 -38
  87. package/examples/specs/equivalent.lawspec +25 -24
  88. package/examples/specs/failures.lawspec +64 -63
  89. package/examples/specs/finite_data.lawspec +32 -31
  90. package/examples/specs/flow_stack.lawspec +64 -63
  91. package/examples/specs/gadt_expressions.lawspec +50 -49
  92. package/examples/specs/generation.lawspec +115 -114
  93. package/examples/specs/handler_bindings.lawspec +42 -40
  94. package/examples/specs/handles.lawspec +2 -1
  95. package/examples/specs/harness.lawspec +45 -43
  96. package/examples/specs/harness_testing.lawspec +18 -13
  97. package/examples/specs/indexed_arithmetic.lawspec +401 -126
  98. package/examples/specs/indexed_families.lawspec +182 -66
  99. package/examples/specs/keywords.lawspec +22 -21
  100. package/examples/specs/limits.lawspec +6 -5
  101. package/examples/specs/list_contracts.lawspec +121 -120
  102. package/examples/specs/list_refinements.lawspec +43 -42
  103. package/examples/specs/lists.lawspec +45 -44
  104. package/examples/specs/matchers.lawspec +79 -78
  105. package/examples/specs/matching.lawspec +43 -42
  106. package/examples/specs/mixed_inputs.lawspec +25 -24
  107. package/examples/specs/models.lawspec +44 -43
  108. package/examples/specs/parse_port.lawspec +28 -27
  109. package/examples/specs/payments.lawspec +55 -54
  110. package/examples/specs/railway.lawspec +59 -58
  111. package/examples/specs/records.lawspec +149 -148
  112. package/examples/specs/records_inner.lawspec +5 -4
  113. package/examples/specs/recursive_refinements.lawspec +30 -29
  114. package/examples/specs/refined_definitions.lawspec +24 -23
  115. package/examples/specs/refinements.lawspec +58 -57
  116. package/examples/specs/resilience.lawspec +159 -158
  117. package/examples/specs/resources.lawspec +61 -60
  118. package/examples/specs/scalar_adapters.lawspec +60 -59
  119. package/examples/specs/scalar_catalog.lawspec +165 -164
  120. package/examples/specs/scalars.lawspec +78 -77
  121. package/examples/specs/scheduling_order.lawspec +8 -7
  122. package/examples/specs/scheduling_overlap.lawspec +5 -4
  123. package/examples/specs/sequences.lawspec +66 -65
  124. package/examples/specs/sessions.lawspec +13 -12
  125. package/examples/specs/slug.lawspec +16 -15
  126. package/examples/specs/sum_refinements.lawspec +42 -41
  127. package/examples/specs/tables.lawspec +29 -28
  128. package/examples/specs/total_functions.lawspec +71 -70
  129. package/examples/specs/workflows.lawspec +101 -100
  130. package/examples-command.mjs +8 -4
  131. package/explain.mjs +114 -0
  132. package/expression-presentation.mjs +333 -0
  133. package/files.mjs +16 -0
  134. package/index.d.ts +406 -11
  135. package/launcher.mjs +9 -2
  136. package/lsp.mjs +235 -0
  137. package/native-evidence.mjs +187 -0
  138. package/native-examples.mjs +8 -1
  139. package/node-events-reporter.mjs +23 -0
  140. package/package.json +8 -1
  141. package/positional-fields.mjs +13 -0
  142. package/proof.d.ts +35 -0
  143. package/proof.mjs +174 -0
  144. package/starter-rc1.lawspec +26 -0
  145. package/starter.lawspec +16 -15
  146. package/templates.mjs +6 -4
  147. package/test-command.mjs +107 -35
  148. package/typed-presentation.mjs +165 -0
@@ -8,17 +8,17 @@ import example.limits as limits
8
8
  -- Delays are whole microseconds.
9
9
 
10
10
  -- The delay before attempt k (2 or more) of each retry strategy.
11
- definition exponentialDelay (base :: Integer where base >= 0 && base <= 1000000)
11
+ function exponentialDelay (base :: Integer where base >= 0 && base <= 1000000)
12
12
  (factor :: Integer where factor >= 1 && factor <= 4)
13
- (attempt :: Integer where attempt >= 2 && attempt <= 10) :: Integer is
13
+ (attempt :: Integer where attempt >= 2 && attempt <= 10) -> Integer is
14
14
  base * prelude.pow factor (attempt - 2)
15
- end
15
+ end function
16
16
 
17
- definition linearDelay (base :: Integer where base >= 0 && base <= 1000000)
17
+ function linearDelay (base :: Integer where base >= 0 && base <= 1000000)
18
18
  (step :: Integer where step >= 0 && step <= 1000000)
19
- (attempt :: Integer where attempt >= 2 && attempt <= 10) :: Integer is
19
+ (attempt :: Integer where attempt >= 2 && attempt <= 10) -> Integer is
20
20
  base + step * (attempt - 2)
21
- end
21
+ end function
22
22
 
23
23
  runtimeExponentialDelay :: Integer -> Integer -> Integer -> Integer
24
24
  runtimeLinearDelay :: Integer -> Integer -> Integer -> Integer
@@ -37,209 +37,210 @@ rejectedWaits :: Int32 -> List Integer
37
37
 
38
38
  -- Unrefined inputs are mapped into range, so every target generates them
39
39
  -- directly: a base up to 65535us, a factor of 1 to 4, and attempts 2 to 10.
40
- law `exponential delays match the reference` is
41
- definition is
42
- `for all` (base :: UInt16) (f :: UInt8) (a :: UInt8) .
40
+ law "|exponential delays match the reference| is
41
+ definition :
42
+ for all (base :: UInt16) (f :: UInt8) (a :: UInt8) =>
43
43
  runtimeExponentialDelay (prelude.Integer base) (1 + prelude.rem (prelude.Integer f) 4) (2 + prelude.rem (prelude.Integer a) 9) =
44
- exponentialDelay (prelude.Integer base) (1 + prelude.rem (prelude.Integer f) 4) (2 + prelude.rem (prelude.Integer a) 9)
45
- end
46
- end
47
-
48
- law `the fifth exponential attempt` is
49
- definition is
50
- `for all` (base :: Integer where base == 100000) . runtimeExponentialDelay base 2 5 = 800000
51
- end
52
- end
53
-
54
- law `linear delays match the reference` is
55
- definition is
56
- `for all` (base :: UInt16) (step :: UInt16) (a :: UInt8) .
44
+ exponentialDelay (prelude.Integer base) (1 + prelude.rem (prelude.Integer f) 4) (2 + prelude.rem (prelude.Integer a) 9) end for all
45
+ end definition
46
+ end law
47
+
48
+ law "|the fifth exponential attempt| is
49
+ definition :
50
+ for all (base :: Integer where base = 100000) => runtimeExponentialDelay base 2 5 = 800000 end for all
51
+ end definition
52
+ end law
53
+
54
+ law "|linear delays match the reference| is
55
+ definition :
56
+ for all (base :: UInt16) (step :: UInt16) (a :: UInt8) =>
57
57
  runtimeLinearDelay (prelude.Integer base) (prelude.Integer step) (2 + prelude.rem (prelude.Integer a) 9) =
58
- linearDelay (prelude.Integer base) (prelude.Integer step) (2 + prelude.rem (prelude.Integer a) 9)
59
- end
60
- end
58
+ linearDelay (prelude.Integer base) (prelude.Integer step) (2 + prelude.rem (prelude.Integer a) 9) end for all
59
+ end definition
60
+ end law
61
61
 
62
- law `fibonacci delays add the two before` is
63
- definition is
64
- `for all` (base :: UInt16) (a :: UInt8) .
62
+ law "|fibonacci delays add the two before| is
63
+ definition :
64
+ for all (base :: UInt16) (a :: UInt8) =>
65
65
  runtimeFibonacciDelay (prelude.Integer base) (4 + prelude.rem (prelude.Integer a) 27) =
66
66
  runtimeFibonacciDelay (prelude.Integer base) (3 + prelude.rem (prelude.Integer a) 27) +
67
- runtimeFibonacciDelay (prelude.Integer base) (2 + prelude.rem (prelude.Integer a) 27)
68
- end
69
- end
67
+ runtimeFibonacciDelay (prelude.Integer base) (2 + prelude.rem (prelude.Integer a) 27) end for all
68
+ end definition
69
+ end law
70
70
 
71
- law `fibonacci delays start at the base` is
72
- definition is
73
- `for all` (base :: UInt16) .
71
+ law "|fibonacci delays start at the base| is
72
+ definition :
73
+ for all (base :: UInt16) =>
74
74
  runtimeFibonacciDelay (prelude.Integer base) 2 = prelude.Integer base and
75
- runtimeFibonacciDelay (prelude.Integer base) 3 = prelude.Integer base
76
- end
77
- end
78
-
79
- law `SplitMix64 is the same everywhere` is
80
- definition is
81
- `for all` (count :: Int8 where count >= 0 && count <= 3) .
82
- prelude.length (splitMix 0 (prelude.Int32 count)) = prelude.Integer count
83
- end
84
- example `seed zero` is
75
+ runtimeFibonacciDelay (prelude.Integer base) 3 = prelude.Integer base end for all
76
+ end definition
77
+ end law
78
+
79
+ law "|SplitMix64 is the same everywhere| is
80
+ definition :
81
+ for all (count :: Int8 where count >= 0 && count <= 3) =>
82
+ prelude.length (splitMix 0 (prelude.Int32 count)) = prelude.Integer count end for all
83
+ end definition
84
+ example "|seed zero| :
85
85
  count = 3
86
86
  expect splitMix 0 (prelude.Int32 count) = [16294208416658607535, 7960286522194355700, 487617019471545679]
87
- end
88
- end
89
-
90
- law `full jitter stays within the delay` is
91
- definition is
92
- `for all` (seed :: UInt64) (delay :: UInt32) .
93
- (fullJitter seed (prelude.Integer delay) >= 0 && fullJitter seed (prelude.Integer delay) <= prelude.Integer delay) = true
94
- end
95
- end
96
-
97
- law `a failing stage waits between its attempts` is
98
- definition is
99
- `for all` (attempts :: Int8 where attempts >= 1 && attempts <= 6) .
100
- prelude.length (retriedWaits (prelude.Int32 attempts)) = prelude.Integer attempts - 1
101
- end
102
- example `four attempts` is
87
+ end example
88
+ end law
89
+
90
+ law "|full jitter stays within the delay| is
91
+ definition :
92
+ for all (seed :: UInt64) (delay :: UInt32) =>
93
+ (fullJitter seed (prelude.Integer delay) >= 0 && fullJitter seed (prelude.Integer delay) <= prelude.Integer delay) = true end for all
94
+ end definition
95
+ end law
96
+
97
+ law "|a failing stage waits between its attempts| is
98
+ definition :
99
+ for all (attempts :: Int8 where attempts >= 1 && attempts <= 6) =>
100
+ prelude.length (retriedWaits (prelude.Int32 attempts)) = prelude.Integer attempts - 1 end for all
101
+ end definition
102
+ example "|four attempts| :
103
103
  attempts = 4
104
104
  expect retriedWaits (prelude.Int32 attempts) = [100000, 200000, 400000]
105
- end
106
- end
105
+ end example
106
+ end law
107
107
 
108
- law `a rejected error is not retried` is
109
- definition is
110
- `for all` (attempts :: Int8 where attempts >= 1 && attempts <= 6) .
111
- rejectedWaits (prelude.Int32 attempts) = []
112
- end
113
- end
108
+ law "|a rejected error is not retried| is
109
+ definition :
110
+ for all (attempts :: Int8 where attempts >= 1 && attempts <= 6) =>
111
+ rejectedWaits (prelude.Int32 attempts) = [] end for all
112
+ end definition
113
+ end law
114
114
 
115
115
  -- Calls limited at each time (microseconds, in order) under one runtime
116
116
  -- with its gates on: whether each call was admitted.
117
117
  limitedAt :: List Integer -> List Bool
118
118
 
119
- definition admits (gate :: r.Gate) :: Bool is
120
- match gate with
121
- | Admit -> true
122
- | WaitFor micros -> false
123
- | Reject -> false
124
- end
125
- end
119
+ function admits (gate :: r.Gate) -> Bool is
120
+ first matching case of gate :
121
+ when r.Admit then true
122
+ when r.WaitFor micros then false
123
+ when r.Reject then false
124
+ end case
125
+ end function
126
126
 
127
127
  -- The reference: the resilience unit's token bucket, folded over the times.
128
- definition bucketRun (state :: r.TokenBucket) (times :: List Integer) :: List Bool is
129
- match times with
130
- | Nil -> Nil
131
- | Cons t rest ->
132
- match r.tokenBucketAdmit 2 1000000 state t with
133
- | Step next gate -> Cons (admits gate) (bucketRun next rest)
134
- end
135
- end
136
- end
128
+ function bucketRun (state :: r.TokenBucket) (times :: List Integer) -> List Bool is
129
+ first matching case of times :
130
+ when Nil then Nil
131
+ when Cons t rest then
132
+ first matching case of r.tokenBucketAdmit 2 1000000 state t :
133
+ when r.Step next gate then Cons (admits gate) (bucketRun next rest)
134
+ end case
135
+ end case
136
+ end function
137
137
 
138
138
  -- Times a millisecond apart and more, as a list of gaps.
139
- definition timesFrom (start :: Integer) (gaps :: List UInt16) :: List Integer is
140
- match gaps with
141
- | Nil -> Nil
142
- | Cons gap rest -> Cons start (timesFrom (start + prelude.Integer gap * 1000) rest)
143
- end
144
- end
145
-
146
- law `the rate limit admits as the token bucket does` is
147
- definition is
148
- `for all` (gaps :: List UInt16) .
149
- limitedAt (timesFrom 0 gaps) = bucketRun (r.tokenBucketStart 2 1000000 0) (timesFrom 0 gaps)
150
- end
151
- example `three calls at once` is
139
+ function timesFrom (start :: Integer) (gaps :: List UInt16) -> List Integer is
140
+ first matching case of gaps :
141
+ when Nil then Nil
142
+ when Cons gap rest then Cons start (timesFrom (start + prelude.Integer gap * 1000) rest)
143
+ end case
144
+ end function
145
+
146
+ law "|the rate limit admits as the token bucket does| is
147
+ definition :
148
+ for all (gaps :: List UInt16) =>
149
+ limitedAt (timesFrom 0 gaps) = bucketRun (r.tokenBucketStart 2 1000000 0) (timesFrom 0 gaps) end for all
150
+ end definition
151
+ example "|three calls at once| :
152
152
  gaps = [0, 0, 0]
153
153
  expect limitedAt (timesFrom 0 gaps) = [true, true, false]
154
- end
155
- end
154
+ end example
155
+ end law
156
156
 
157
157
  -- The other state machines, which every target runs as generated code.
158
- law `an open breaker rejects until its cooldown ends` is
159
- definition is
160
- `for all` (t :: UInt16) .
158
+ law "|an open breaker rejects until its cooldown ends| is
159
+ definition :
160
+ for all (t :: UInt16) =>
161
161
  r.breakerAdmit (r.Open 1000) (prelude.Integer t) =
162
- prelude.select (prelude.Integer t >= 1000) (r.Step r.HalfOpen r.Admit) (r.Step (r.Open 1000) r.Reject)
163
- end
164
- end
162
+ prelude.select (prelude.Integer t >= 1000) (r.Step r.HalfOpen r.Admit) (r.Step (r.Open 1000) r.Reject) end for all
163
+ end definition
164
+ end law
165
165
 
166
- law `a breaker opens after enough failures in its window` is
167
- definition is
168
- `for all` (gap :: UInt8) .
166
+ law "|a breaker opens after enough failures in its window| is
167
+ definition :
168
+ for all (gap :: UInt8) =>
169
169
  r.breakerRecord 2 1000 500 (r.breakerRecord 2 1000 500 (r.Closed []) 10 false) (10 + prelude.Integer gap) false =
170
- r.Open (510 + prelude.Integer gap)
171
- end
172
- end
170
+ r.Open (510 + prelude.Integer gap) end for all
171
+ end definition
172
+ end law
173
173
 
174
- law `a breaker forgets failures outside its window` is
175
- definition is
176
- `for all` (gap :: UInt8) .
174
+ law "|a breaker forgets failures outside its window| is
175
+ definition :
176
+ for all (gap :: UInt8) =>
177
177
  r.breakerRecord 2 100 500 (r.breakerRecord 2 100 500 (r.Closed []) 0 false) (200 + prelude.Integer gap) false =
178
- r.Closed [200 + prelude.Integer gap]
179
- end
180
- end
181
-
182
- law `a successful trial closes the breaker` is
183
- definition is
184
- `for all` (t :: UInt16) . r.breakerRecord 2 1000 500 r.HalfOpen (prelude.Integer t) true = r.Closed []
185
- end
186
- end
187
-
188
- law `a bulkhead admits up to its limit` is
189
- definition is
190
- `for all` (running :: UInt8) .
178
+ r.Closed [200 + prelude.Integer gap] end for all
179
+ end definition
180
+ end law
181
+
182
+ law "|a successful trial closes the breaker| is
183
+ definition :
184
+ for all (t :: UInt16) => r.breakerRecord 2 1000 500 r.HalfOpen (prelude.Integer t) true = r.Closed [] end for all
185
+ end definition
186
+ end law
187
+
188
+ law "|a bulkhead admits up to its limit| is
189
+ definition :
190
+ for all (running :: UInt8) =>
191
191
  r.bulkheadAdmit 4 (r.Bulkhead (prelude.Integer running)) 0 =
192
192
  prelude.select (prelude.Integer running < 4)
193
193
  (r.Step (r.Bulkhead (prelude.Integer running + 1)) r.Admit)
194
- (r.Step (r.Bulkhead (prelude.Integer running)) (r.WaitFor 1000))
195
- end
196
- end
194
+ (r.Step (r.Bulkhead (prelude.Integer running)) (r.WaitFor 1000)) end for all
195
+ end definition
196
+ end law
197
197
 
198
- law `a sliding window admits n calls per period` is
199
- definition is
200
- `for all` (t :: UInt16) .
198
+ law "|a sliding window admits n calls per period| is
199
+ definition :
200
+ for all (t :: UInt16) =>
201
201
  r.slidingWindowAdmit 2 1000 (r.SlidingWindow [prelude.Integer t, prelude.Integer t]) (prelude.Integer t + 1) =
202
- r.Step (r.SlidingWindow [prelude.Integer t, prelude.Integer t]) (r.WaitFor 999)
203
- end
204
- end
202
+ r.Step (r.SlidingWindow [prelude.Integer t, prelude.Integer t]) (r.WaitFor 999) end for all
203
+ end definition
204
+ end law
205
205
 
206
206
  -- Books a ticket under a fresh runtime: the stages whose undos ran.
207
207
  compensationsFor :: Int64 -> List Text
208
208
 
209
- law `a failed booking releases its seat` is
210
- definition is
211
- `for all` (n :: Int64) .
212
- compensationsFor n = prelude.select (n < 0) ["reserveSeat"] []
213
- end
214
- end
209
+ law "|a failed booking releases its seat| is
210
+ definition :
211
+ for all (n :: Int64) =>
212
+ compensationsFor n = prelude.select (n < 0) ["reserveSeat"] [] end for all
213
+ end definition
214
+ end law
215
215
 
216
216
  -- Quotes a ticket under a runtime with the real clock: whether it timed out.
217
217
  async quoteTimedOut :: Int64 -> Bool
218
218
 
219
- law `a slow quote times out` is
220
- definition is
221
- `for all` (n :: Int64) . quoteTimedOut n = (n == -1)
222
- end
223
- example `a slow quote` is
219
+ law "|a slow quote times out| is
220
+ definition :
221
+ for all (n :: Int64) => quoteTimedOut n = (n = -1) end for all
222
+ end definition
223
+ example "|a slow quote| :
224
224
  n = -1
225
225
  expect quoteTimedOut n = true
226
- end
227
- example `a quick quote` is
226
+ end example
227
+ example "|a quick quote| :
228
228
  n = 0
229
229
  expect quoteTimedOut n = false
230
- end
231
- end
230
+ end example
231
+ end law
232
232
 
233
233
  -- Quotes a ticket under a runtime with the real clock: whether it succeeded
234
234
  -- quickly (within 400ms), for ticket -2 through a hedged attempt.
235
235
  async quoteHedged :: Int64 -> Bool
236
236
 
237
- law `a stalled quote is hedged` is
238
- definition is
239
- `for all` (n :: Int64) . quoteHedged n = true
240
- end
241
- example `a stalled quote` is
237
+ law "|a stalled quote is hedged| is
238
+ definition :
239
+ for all (n :: Int64) => quoteHedged n = true end for all
240
+ end definition
241
+ example "|a stalled quote| :
242
242
  n = -2
243
243
  expect quoteHedged n = true
244
- end
245
- end
244
+ end example
245
+ end law
246
+ end unit
@@ -17,28 +17,28 @@ isOpen :: Store -> Bool
17
17
  size :: Store -> Int32
18
18
 
19
19
  resource Store is
20
- acquire is openStore unitValue end
21
- release store is closeStore store end
22
- reset store is clearStore store end
23
- end
24
-
25
- law `a stored value can be read back` for store :: Store is
26
- definition is
27
- `for all` (k :: Int32) (v :: Int32) . put store k v = unitValue and get store k = Just v
28
- end
29
- example `the store is open while the case runs` is
20
+ acquire is openStore unitValue end acquire
21
+ release store is closeStore store end release
22
+ reset store is clearStore store end reset
23
+ end resource
24
+
25
+ law "|a stored value can be read back| for store :: Store is
26
+ definition :
27
+ for all (k :: Int32) (v :: Int32) => put store k v = unitValue and get store k = Just v end for all
28
+ end definition
29
+ example "|the store is open while the case runs| :
30
30
  k = 1
31
31
  v = 2
32
32
  expect isOpen store
33
- end
34
- end
33
+ end example
34
+ end law
35
35
 
36
- law `every case gets an empty store` for store :: Store is
37
- definition is
38
- `for all` (k :: Int32) (v :: Int32) .
39
- size store = 0 and put store k v = unitValue and size store = 1
40
- end
41
- end
36
+ law "|every case gets an empty store| for store :: Store is
37
+ definition :
38
+ for all (k :: Int32) (v :: Int32) =>
39
+ size store = 0 and put store k v = unitValue and size store = 1 end for all
40
+ end definition
41
+ end law
42
42
 
43
43
  -- Built-in resources: a temporary directory, a free port, and the
44
44
  -- environment, saved and restored.
@@ -48,36 +48,36 @@ canListen :: Int32 -> Bool
48
48
  setGreeting :: Int32 -> Unit
49
49
  greeting :: Unit -> Maybe Int32
50
50
 
51
- law `a note reads back` for dir :: TemporaryDirectory is
52
- definition is
53
- `for all` (n :: Int32) .
54
- writeNote (directoryPath dir) n = unitValue and readNote (directoryPath dir) = Just n
55
- end
56
- end
51
+ law "|a note reads back| for dir :: TemporaryDirectory is
52
+ definition :
53
+ for all (n :: Int32) =>
54
+ writeNote (directoryPath dir) n = unitValue and readNote (directoryPath dir) = Just n end for all
55
+ end definition
56
+ end law
57
57
 
58
- law `a new directory has no note` for dir :: TemporaryDirectory is
59
- definition is
58
+ law "|a new directory has no note| for dir :: TemporaryDirectory is
59
+ definition :
60
60
  readNote (directoryPath dir) = Nothing
61
- end
62
- end
61
+ end definition
62
+ end law
63
63
 
64
- law `a free port can be listened on` for port :: FreePort is
65
- definition is
64
+ law "|a free port can be listened on| for port :: FreePort is
65
+ definition :
66
66
  canListen (portNumber port) = true
67
- end
68
- end
67
+ end definition
68
+ end law
69
69
 
70
- law `the greeting is the one set` for saved :: SavedEnvironment is
71
- definition is
72
- `for all` (n :: Int32) . setGreeting n = unitValue and greeting unitValue = Just n
73
- end
74
- end
70
+ law "|the greeting is the one set| for saved :: SavedEnvironment is
71
+ definition :
72
+ for all (n :: Int32) => setGreeting n = unitValue and greeting unitValue = Just n end for all
73
+ end definition
74
+ end law
75
75
 
76
- law `the environment is restored after each case` for saved :: SavedEnvironment is
77
- definition is
76
+ law "|the environment is restored after each case| for saved :: SavedEnvironment is
77
+ definition :
78
78
  greeting unitValue = Nothing
79
- end
80
- end
79
+ end definition
80
+ end law
81
81
 
82
82
  -- A pool is costly to open, so the harness shares one between the cases of
83
83
  -- this unit's laws. Sharing is allowed only because Pool declares reset:
@@ -92,25 +92,26 @@ fill :: Pool -> Int32 -> Unit
92
92
  level :: Pool -> Int32
93
93
 
94
94
  resource Pool is
95
- acquire is openPool unitValue end
96
- release pool is closePool pool end
97
- reset pool is drainPool pool end
98
- end
99
-
100
- law `a pool starts each case empty` for pool :: Pool is
101
- definition is
102
- `for all` (n :: Int32 where n > 0 && n <= 100) .
103
- level pool = 0 and fill pool n = unitValue and level pool = n
104
- end
105
- end
106
-
107
- law `filling twice adds up` for pool :: Pool is
108
- definition is
109
- `for all` (a :: Int32 where a > 0 && a <= 100) (b :: Int32 where b > 0 && b <= 100) .
110
- fill pool a = unitValue and fill pool b = unitValue and level pool = a + b
111
- end
112
- end
95
+ acquire is openPool unitValue end acquire
96
+ release pool is closePool pool end release
97
+ reset pool is drainPool pool end reset
98
+ end resource
99
+
100
+ law "|a pool starts each case empty| for pool :: Pool is
101
+ definition :
102
+ for all (n :: Int32 where n > 0 && n <= 100) =>
103
+ level pool = 0 and fill pool n = unitValue and level pool = n end for all
104
+ end definition
105
+ end law
106
+
107
+ law "|filling twice adds up| for pool :: Pool is
108
+ definition :
109
+ for all (a :: Int32 where a > 0 && a <= 100) (b :: Int32 where b > 0 && b <= 100) =>
110
+ fill pool a = unitValue and fill pool b = unitValue and level pool = a + b end for all
111
+ end definition
112
+ end law
113
113
 
114
114
  harness example.resources.testing for example.resources is
115
115
  share Pool per unit
116
- end
116
+ end harness
117
+ end unit