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
@@ -1,13 +1,14 @@
1
1
  unit shop.orders
2
- import shop.domain as domain (Money, Cents, `commutative`, `idempotent`)
2
+ import shop.domain as domain (Money, Cents, law "|commutative|, law
3
+ "|idempotent|)
3
4
  -- shop.domain uses version 1 of shop.tax; this project's range selects
4
5
  -- version 2. Both are in the build, and their Bands are different types.
5
6
  import shop.tax.api as tax (Band)
6
7
 
7
8
  -- Constructor names are scoped to their unit: this Usd is not domain.Usd.
8
- type Currency is | Usd | Gbp end
9
+ type Currency is one of | Usd | Gbp end type
9
10
 
10
- type Line is Line price :: Money quantity :: domain.Quantity end
11
+ type Line is a record{ price :: Money quantity :: domain.Quantity} end type
11
12
 
12
13
  settlement :: Currency -> domain.Currency
13
14
  lineTotal :: Line -> Money
@@ -17,66 +18,69 @@ cheaper :: Int64 -> Int64 -> Int64
17
18
  roundDown :: Int64 -> Int64
18
19
  classify :: Int64 -> Band
19
20
 
20
- law `dollars settle in dollars` is
21
- definition is
21
+ law "|dollars settle in dollars| is
22
+ definition :
22
23
  settlement Usd = domain.Usd
23
- end
24
- end
24
+ end definition
25
+ end law
25
26
 
26
- law `pounds settle in euros` is
27
- definition is
27
+ law "|pounds settle in euros| is
28
+ definition :
28
29
  settlement Gbp = domain.Eur
29
- end
30
- end
30
+ end definition
31
+ end law
31
32
 
32
- law `a line total keeps the price currency` is
33
- definition is
34
- `for all` (l :: Line) .
35
- domain.currencyOf (lineTotal l) = (match l with
36
- | Line p q -> domain.currencyOf p
37
- end)
38
- end
39
- example `two items` is
40
- l = Line (Money domain.Usd 250) (domain.Quantity 2)
33
+ law "|a line total keeps the price currency| is
34
+ definition :
35
+ for all (l :: Line) =>
36
+ domain.currencyOf (lineTotal l) = (first matching case of l :
37
+ when Line record{ price = p , quantity = q} then domain.currencyOf p
38
+ end case) end for all
39
+ end definition
40
+ example "|two items| :
41
+ l = Line record{ price = (Money record{ currency = domain.Usd , cents =
42
+ 250}) , quantity = (domain.Quantity 2)}
41
43
  expect domain.centsOf (lineTotal l) = 500
42
- end
43
- end
44
+ end example
45
+ end law
44
46
 
45
- law `the cheaper price does not depend on order` is
46
- definition is
47
- `commutative` cheaper
48
- end
49
- end
47
+ law "|the cheaper price does not depend on order| is
48
+ definition :
49
+ apply law "|commutative| cheaper
50
+ end definition
51
+ end law
50
52
 
51
- law `rounding down to whole dollars is stable` is
52
- definition is
53
- `idempotent` roundDown
54
- end
55
- end
53
+ law "|rounding down to whole dollars is stable| is
54
+ definition :
55
+ apply law "|idempotent| roundDown
56
+ end definition
57
+ end law
56
58
 
57
- law `rounding down never raises a price` is
58
- definition is
59
- `for all` (c :: Cents) . roundDown c <= c
60
- end
61
- end
59
+ law "|rounding down never raises a price| is
60
+ definition :
61
+ for all (c :: Cents) => roundDown c <= c end for all
62
+ end definition
63
+ end law
62
64
 
63
- law `prices are classified into version 2 bands` is
64
- definition is
65
- `for all` (c :: Cents) . tax.rateOf (classify c) <= 25
66
- end
67
- example `nothing` is c = 0 expect classify c = Zero end
68
- example `small` is c = 9999 expect classify c = Low end
69
- example `large` is c = 10000 expect classify c = High end
70
- end
65
+ law "|prices are classified into version 2 bands| is
66
+ definition :
67
+ for all (c :: Cents) => tax.rateOf (classify c) <= 25 end for all
68
+ end definition
69
+ example "|nothing| : c = 0 expect classify c = Zero end example
70
+ example "|small| : c = 9999 expect classify c = Low end example
71
+ example "|large| : c = 10000 expect classify c = High end example
72
+ end law
71
73
 
72
- law `shop.domain keeps version 1 of the bands` is
73
- definition is
74
+ law "|shop.domain keeps version 1 of the bands| is
75
+ definition :
74
76
  domain.dutyOf domain.High = 20
75
- end
76
- end
77
+ end definition
78
+ end law
77
79
 
78
- law `this project sees version 2 of the bands` is
79
- definition is
80
+ law "|this project sees version 2 of the bands| is
81
+ definition :
80
82
  tax.rateOf High = 25
81
- end
82
- end
83
+ end definition
84
+ end law
85
+
86
+ end unit
@@ -8,50 +8,53 @@ export Band
8
8
  -- A package of reusable types, refinements, definitions and laws. Other units
9
9
  -- import it by name; its declarations keep their own names, so an importer may
10
10
  -- declare a Currency or a Usd of its own.
11
- type Currency is | Usd | Eur end
11
+ type Currency is one of | Usd | Eur end type
12
12
 
13
- refinement Cents is (c :: Int64 where c >= 0 && c <= 100000000) end
13
+ refinement Cents is (c :: Int64 where c >= 0 && c <= 100000000) end refinement
14
14
 
15
- type Money is Money currency :: Currency cents :: Cents end
15
+ type Money is a record{ currency :: Currency cents :: Cents} end type
16
16
 
17
- wrapper Quantity is Int32 where value >= 1 && value <= 1000 end
17
+ wrapper Quantity is Int32 where value >= 1 && value <= 1000 end wrapper
18
18
 
19
- definition currencyOf (m :: Money) :: Currency is
20
- match m with | Money c n -> c end
21
- end
19
+ function currencyOf (m :: Money) -> Currency is
20
+ first matching case of m : when Money record{ currency = c , cents = n} then c
21
+ end case
22
+ end function
22
23
 
23
- definition centsOf (m :: Money) :: Int64 is
24
- match m with | Money c n -> n end
25
- end
24
+ function centsOf (m :: Money) -> Int64 is
25
+ first matching case of m : when Money record{ currency = c , cents = n} then n
26
+ end case
27
+ end function
26
28
 
27
29
  -- The duty on a band, at version 1's rates.
28
- definition dutyOf (b :: Band) :: Int64 is tax.rateOf b end
30
+ function dutyOf (b :: Band) -> Int64 is tax.rateOf b end function
29
31
 
30
32
  -- Generic laws are templates: an importer applies them to its own adapters.
31
- law `commutative` (f :: a -> a -> a) requires Eq a is
32
- definition is
33
- `for all` (x :: a) (y :: a) . f x y = f y x
34
- end
35
- end
36
-
37
- law `idempotent` (f :: a -> a) requires Eq a is
38
- definition is
39
- `for all` (x :: a) . f (f x) = f x
40
- end
41
- end
33
+ law "|commutative| (f :: a -> a -> a) requires Eq a is
34
+ definition :
35
+ for all (x :: a) (y :: a) => f x y = f y x end for all
36
+ end definition
37
+ end law
38
+
39
+ law "|idempotent| (f :: a -> a) requires Eq a is
40
+ definition :
41
+ for all (x :: a) => f (f x) = f x end for all
42
+ end definition
43
+ end law
42
44
 
43
45
  -- A published contract: every project that depends on this package implements
44
46
  -- convert and is tested against these laws.
45
47
  convert :: Currency -> Money -> Money
46
48
 
47
- law `conversion targets the requested currency` is
48
- definition is
49
- `for all` (c :: Currency) (m :: Money) . currencyOf (convert c m) = c
50
- end
51
- end
52
-
53
- law `converting to the same currency changes nothing` is
54
- definition is
55
- `for all` (m :: Money) . convert (currencyOf m) m = m
56
- end
57
- end
49
+ law "|conversion targets the requested currency| is
50
+ definition :
51
+ for all (c :: Currency) (m :: Money) => currencyOf (convert c m) = c end for all
52
+ end definition
53
+ end law
54
+
55
+ law "|converting to the same currency changes nothing| is
56
+ definition :
57
+ for all (m :: Money) => convert (currencyOf m) m = m end for all
58
+ end definition
59
+ end law
60
+ end unit
@@ -4,3 +4,4 @@ import shop.tax.rates as rates (Band)
4
4
  -- The package's facade: importers use shop.tax.api, and the names it
5
5
  -- re-exports are the declarations of shop.tax.rates, not copies.
6
6
  export Band, rates.rateOf
7
+ end unit
@@ -1,8 +1,9 @@
1
1
  unit shop.tax.rates
2
2
 
3
3
  -- Version 1 of the tax bands.
4
- type Band is | Low | High end
4
+ type Band is one of | Low | High end type
5
5
 
6
- definition rateOf (b :: Band) :: Int64 is
7
- match b with | Low -> 5 | High -> 20 end
8
- end
6
+ function rateOf (b :: Band) -> Int64 is
7
+ first matching case of b : when Low then 5 when High then 20 end case
8
+ end function
9
+ end unit
@@ -4,3 +4,4 @@ import shop.tax.rates as rates (Band)
4
4
  -- The package's facade: importers use shop.tax.api, and the names it
5
5
  -- re-exports are the declarations of shop.tax.rates, not copies.
6
6
  export Band, rates.rateOf
7
+ end unit
@@ -2,8 +2,10 @@ unit shop.tax.rates
2
2
 
3
3
  -- Version 2 adds a zero band and changes the rates. A build may hold both
4
4
  -- versions: each dependent sees the one its version range selects.
5
- type Band is | Zero | Low | High end
5
+ type Band is one of | Zero | Low | High end type
6
6
 
7
- definition rateOf (b :: Band) :: Int64 is
8
- match b with | Zero -> 0 | Low -> 10 | High -> 25 end
9
- end
7
+ function rateOf (b :: Band) -> Int64 is
8
+ first matching case of b : when Zero then 0 when Low then 10 when High then 25
9
+ end case
10
+ end function
11
+ end unit
@@ -0,0 +1,113 @@
1
+ unit example.rc1.authorizationSnapshots
2
+
3
+ type Payment is one of
4
+ | FirstPayment
5
+ | SecondPayment
6
+ end type
7
+
8
+ type Authorization is one of
9
+ | FirstApproval
10
+ | SecondApproval
11
+ end type
12
+
13
+ type AuthorizationState is one of
14
+ | Ready
15
+ | FirstRevoked
16
+ | AllRevoked
17
+ end type
18
+
19
+ function active (state of type AuthorizationState)
20
+ (authorization of type Authorization) -> Bool is
21
+ first matching case of state:
22
+ when Ready then true
23
+ when FirstRevoked then authorization = SecondApproval
24
+ when AllRevoked then false
25
+ end case
26
+ end function
27
+
28
+ function authorizes (authorization of type Authorization)
29
+ (payment of type Payment) -> Bool is
30
+ first matching case of authorization:
31
+ when FirstApproval then payment = FirstPayment
32
+ when SecondApproval then payment = SecondPayment
33
+ end case
34
+ end function
35
+
36
+ law "|ready payments have authorization| is
37
+ definition:
38
+ for all (payment of type Payment) =>
39
+ there must exist an (authorization of type Authorization
40
+ where active Ready the authorization) such that
41
+ authorization `authorizes payment
42
+ end exists
43
+ end for all
44
+ end definition
45
+
46
+ description:
47
+ "The Ready snapshot contains an active approval for each payment."
48
+ end description
49
+ end law
50
+
51
+ law "|the revoked first approval is absent| is
52
+ definition:
53
+ there does not exist (authorization of type Authorization
54
+ where active FirstRevoked the authorization) such that
55
+ authorization `authorizes FirstPayment
56
+ end exists
57
+ end definition
58
+
59
+ description:
60
+ "The FirstRevoked snapshot has no active approval for the first payment."
61
+ end description
62
+ end law
63
+
64
+ law "|all revoked approvals are absent| is
65
+ definition:
66
+ for all (payment of type Payment) =>
67
+ there must not exist (authorization of type Authorization
68
+ where active AllRevoked the authorization) such that
69
+ authorization `authorizes payment
70
+ end exists
71
+ end for all
72
+ end definition
73
+ end law
74
+
75
+ law "|one approval cannot cover every payment| is
76
+ definition:
77
+ must not there exists (authorization of type Authorization) such that
78
+ for all (payment of type Payment) =>
79
+ authorization `authorizes payment
80
+ end for all
81
+ end exists
82
+ end definition
83
+
84
+ rationale:
85
+ "Each approval belongs to one payment. Quantifier order changes the claim."
86
+ end rationale
87
+ end law
88
+
89
+ law "|activation matches the complete snapshot| is
90
+ definition:
91
+ for all (state of type AuthorizationState)
92
+ (authorization of type Authorization) =>
93
+ active state authorization must be
94
+ (state = Ready or
95
+ (state = FirstRevoked and authorization = SecondApproval))
96
+ end for all
97
+ end definition
98
+
99
+ expect active state authorization = expected
100
+ in table (state, authorization, expected):
101
+ row Ready, FirstApproval, true
102
+ row Ready, SecondApproval, true
103
+ row FirstRevoked, FirstApproval, false
104
+ row FirstRevoked, SecondApproval, true
105
+ row AllRevoked, FirstApproval, false
106
+ row AllRevoked, SecondApproval, false
107
+ end table
108
+
109
+ description:
110
+ "The search domain is exactly two approval identities in one snapshot."
111
+ end description
112
+ end law
113
+ end unit
@@ -0,0 +1,64 @@
1
+ unit pictures.banners
2
+
3
+ type Picture is a record{
4
+ fileName of type Text
5
+ dimensions of type record{
6
+ width of type Nat
7
+ height of type Nat
8
+ }
9
+ }
10
+ end type
11
+
12
+ type BannerDecision is one of
13
+ | Rejected of type Text
14
+ | Eligible
15
+ | TooSmall
16
+ end type
17
+
18
+ function containsProfanity (input of type Text) -> Bool is
19
+ let folded = prelude.caseFold input in
20
+ prelude.any (prelude.textContains folded) ["shit", "piss", "fuck"] end let
21
+ end function
22
+
23
+ function bannerDecision (picture of type Picture) -> BannerDecision is
24
+ first matching case of picture.fileName:
25
+ when containsProfanity it then Rejected it
26
+ otherwise
27
+ if picture.dimensions.width >= 1200 and picture.dimensions.height >= 300
28
+ then
29
+ Eligible
30
+ else
31
+ TooSmall
32
+ end if
33
+ end case
34
+ end function
35
+
36
+ law "|prohibited filenames are rejected before checking dimensions| is
37
+ description:
38
+ "A prohibited fragment rejects the filename at every size. Clean banners need at least 1200 pixels of width and 300 pixels of height."
39
+ end description
40
+ definition:
41
+ for all (picture of type Picture) =>
42
+ containsProfanity picture.fileName implies
43
+ bannerDecision picture must be Rejected picture.fileName
44
+ end for all
45
+ end definition
46
+ expect bannerDecision picture = expected
47
+ in table (picture, expected):
48
+ row Picture record{fileName = "banner.png", dimensions = record{width =
49
+ 1200, height = 300}}, Eligible
50
+ row Picture record{fileName = "portrait.png", dimensions = record{width =
51
+ 100, height = 100}}, TooSmall
52
+ row Picture record{fileName = "SHIT.png", dimensions = record{width = 1200,
53
+ height = 300}}, Rejected "SHIT.png"
54
+ row Picture record{fileName = "xxpIssxx.jpg", dimensions = record{width = 1,
55
+ height = 1}}, Rejected "xxpIssxx.jpg"
56
+ row Picture record{fileName = "PIẞ.png", dimensions = record{width = 1,
57
+ height = 1}}, Rejected "PIẞ.png"
58
+ row Picture record{fileName = "ſhit.png", dimensions = record{width = 1,
59
+ height = 1}}, Rejected "ſhit.png"
60
+ row Picture record{fileName = "fucK.png", dimensions = record{width = 1,
61
+ height = 1}}, Rejected "fucK.png"
62
+ end table
63
+ end law
64
+ end unit
@@ -0,0 +1,57 @@
1
+ unit example.rc1.bitCodec
2
+
3
+ mapping bitText of type Bool -> Text is
4
+ row false, "0"
5
+ row true, "1"
6
+ end mapping
7
+
8
+ function decodeBit (text of type Text) -> Maybe Bool is
9
+ bitTextInverse text
10
+ end function
11
+
12
+ function "|decode with zero default| (text of type Text) -> Bool is
13
+ first matching case of decodeBit text:
14
+ when Just bit then bit
15
+ when Nothing then false
16
+ end case
17
+ end function
18
+
19
+ law "|each bit is recovered| is
20
+ definition:
21
+ for all (bit of type Bool) =>
22
+ decodeBit (bitText bit) must be Just bit
23
+ end for all
24
+ end definition
25
+
26
+ description:
27
+ "Each bit has a one-character encoding that decodes to the original bit."
28
+ end description
29
+
30
+ expect bitText bit = encoded
31
+ expect decodeBit encoded = decoded
32
+ in table (bit, encoded, decoded):
33
+ row false, "0", Just false
34
+ row true, "1", Just true
35
+ end table
36
+ end law
37
+
38
+ law "|decoding is a left inverse| is
39
+ definition:
40
+ apply law "|left inverse| "|decode with zero default| bitText
41
+ end definition
42
+
43
+ description:
44
+ "Decoding an encoded bit recovers it. The inverse is the first argument."
45
+ end description
46
+ end law
47
+
48
+ law "|other text has no bit| is
49
+ definition:
50
+ decodeBit "01" must be Nothing
51
+ end definition
52
+
53
+ description:
54
+ "Two characters are not one encoded bit. Invalid input has no decoded value."
55
+ end description
56
+ end law
57
+ end unit
@@ -0,0 +1,151 @@
1
+ unit example.rc1.boundedWitnessSearch
2
+
3
+ type RequestLabel is a record{
4
+ text of type Text
5
+ }
6
+ end type
7
+
8
+ function keepValue (value of type a) -> a is
9
+ value
10
+ end function
11
+
12
+ function reply (allowed of type Bool) -> Integer is
13
+ if allowed then 1 else 2 end if
14
+ end function
15
+
16
+ function labelFor (allowed of type Bool) -> RequestLabel is
17
+ RequestLabel record{
18
+ text = if allowed then "approved" else "declined" end if
19
+ }
20
+ end function
21
+
22
+ law "|each request can receive its matching reply| is
23
+ description:
24
+ "Allowed requests receive reply one; other requests receive reply two."
25
+ end description
26
+ definition:
27
+ for all (allowed of type Bool) =>
28
+ there exists (answer of type Integer) such that
29
+ answer must be reply allowed
30
+ end exists
31
+ end for all
32
+ end definition
33
+ expect reply allowed = expected
34
+ in table (allowed, expected):
35
+ row true, 1
36
+ row false, 2
37
+ end table
38
+ end law
39
+
40
+ law "|each request can receive its matching label| is
41
+ definition:
42
+ for all (allowed of type Bool) =>
43
+ there exists (label of type RequestLabel) such that
44
+ label.text must be (if allowed then "approved" else "declined" end if)
45
+ end exists
46
+ end for all
47
+ end definition
48
+ end law
49
+
50
+ law "|an adjusted amount can exceed any exact amount| is
51
+ definition:
52
+ for all (amount of type Integer) =>
53
+ there exists (adjusted of type Integer where adjusted > amount) such that
54
+ adjusted > amount
55
+ end exists
56
+ end for all
57
+ end definition
58
+ end law
59
+
60
+ law "|a small amount cannot be both positive and nonpositive| is
61
+ definition:
62
+ there must not exist (amount of type Integer where
63
+ amount >= 0 and amount <= 3) such that
64
+ amount > 0 and amount <= 0
65
+ end exists
66
+ end definition
67
+ end law
68
+
69
+ law "|independent requirements can choose distinct amounts| is
70
+ definition:
71
+ (there exists (amount of type Integer) such that amount = 1 end exists)
72
+ and
73
+ (there exists (amount of type Integer) such that amount = 2 end exists)
74
+ end definition
75
+ end law
76
+
77
+ law "|a dependent strategy can propose the adjusted count| is
78
+ definition:
79
+ there exists (count of type Integer) such that
80
+ count must be 4
81
+ end exists
82
+ end definition
83
+ end law
84
+
85
+ law "|an exceptional request can receive a manual category| is
86
+ definition:
87
+ there exists (category of type Text) such that
88
+ category must be "manual"
89
+ end exists
90
+ end definition
91
+ end law
92
+
93
+ law "|consecutive exact cents have no intermediate amount| is
94
+ definition:
95
+ for all (amount of type Integer)
96
+ (between of type Integer where between > amount and between < amount + 1)
97
+ =>
98
+ false
99
+ end for all
100
+ end definition
101
+ end law
102
+
103
+ law "|exact amounts are not all zero| is
104
+ definition:
105
+ must not for all (amount of type Integer) =>
106
+ amount = 0
107
+ end for all
108
+ end definition
109
+ end law
110
+
111
+ harness example.rc1.boundedWitnessSearch.testing for example.rc1.boundedWitnessSearch is
112
+ strategy replies of type Integer is one of 1, 2 end strategy
113
+ strategy labels of type RequestLabel is
114
+ one of keepValue (labelFor true), keepValue (labelFor false)
115
+ end strategy
116
+ strategy firstAmount of type Integer is one of 1 end strategy
117
+ strategy secondAmount of type Integer is one of 2 end strategy
118
+ strategy bases of type Integer is one of 0, 3 end strategy
119
+ strategy counts of type Integer is
120
+ (bind base of type Integer from bases in one of base + 1 end bind)
121
+ such that it > 0
122
+ end strategy
123
+ strategy ordinaryCategory of type Text is one of "automatic" end strategy
124
+ strategy manualCategory of type Text is one of "manual" end strategy
125
+ strategy categories of type Text is
126
+ frequency 3 ordinaryCategory, 1 manualCategory
127
+ end strategy
128
+ strategy nonzeroAmount of type Integer is one of 1 end strategy
129
+
130
+ for law "|each request can receive its matching reply|
131
+ witness 0 for allowed.answer
132
+ use replies for definition.allowed.answer
133
+ end for law
134
+ for law "|each request can receive its matching label|
135
+ use labels for allowed.label
136
+ end for law
137
+ for law "|independent requirements can choose distinct amounts|
138
+ use firstAmount for branch1.amount
139
+ use secondAmount for definition.branch2.amount
140
+ end for law
141
+ for law "|a dependent strategy can propose the adjusted count|
142
+ use counts for count
143
+ end for law
144
+ for law "|an exceptional request can receive a manual category|
145
+ use categories for category
146
+ end for law
147
+ for law "|exact amounts are not all zero|
148
+ use nonzeroAmount for amount
149
+ end for law
150
+ end harness
151
+ end unit
@@ -0,0 +1,31 @@
1
+ unit example.conflictingRefunds
2
+
3
+ type RefundDecision is one of
4
+ | Approved
5
+ | ReviewRequired
6
+ end type
7
+
8
+ function proposedDecision (flagged of type Bool) -> RefundDecision is
9
+ if flagged then ReviewRequired else Approved end if
10
+ end function
11
+
12
+ law "|every request is approved| is
13
+ description:
14
+ "The first requirement demands approval even when a request is flagged."
15
+ end description
16
+ definition:
17
+ for all (flagged of type Bool) =>
18
+ proposedDecision flagged must be Approved
19
+ end for all
20
+ end definition
21
+ end law
22
+
23
+ law "|a flagged request requires review| is
24
+ description:
25
+ "The second requirement demands a different result for the same request."
26
+ end description
27
+ definition:
28
+ proposedDecision true must be ReviewRequired
29
+ end definition
30
+ end law
31
+ end unit