1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
{-# LANGUAGE OverloadedStrings #-}
module Test.Unit.Checking (unitTests) where
import Base
import Checking
import Encoding (encodeTaskText)
import Report.Location
import Syntax.Internal
import Syntax.Lexicon (_Onesorted)
import Control.Exception (try)
import Data.Set qualified as Set
import Data.Text qualified as Text
import Test.Tasty
import Test.Tasty.HUnit
unitTests :: TestTree
unitTests = testGroup "Checking"
[ testCase "fix rejects shadowing theorem-local variables" do
expectCheckingError "already in scope" (lemmaBlocks "bad_fix" badFixLemma badFixProof)
, testCase "define rejects shadowing local variables" do
expectCheckingError "already in scope" (lemmaBlocks "bad_define" badDefineLemma badDefineProof)
, testCase "take rejects shadowing theorem-local variables" do
expectCheckingError "already in scope" (lemmaBlocks "bad_take" badTakeLemma badTakeProof)
, testCase "have rejects new free variables" do
expectCheckingError "not in scope" (lemmaBlocks "bad_have" badHaveLemma badHaveProof)
, testCase "define function rejects shadowing function name" do
expectCheckingError "already in scope" (lemmaBlocks "bad_define_function_name" badDefineFunctionNameLemma badDefineFunctionNameProof)
, testCase "define function rejects shadowing argument name" do
expectCheckingError "shadow local variable" (lemmaBlocks "bad_define_function_arg" badDefineFunctionArgLemma badDefineFunctionArgProof)
, testCase "free theorem goal variables are local in proofs" do
expectChecks (lemmaBlocks "free_goal_local" freeGoalLocalLemma freeGoalLocalProof)
, testCase "fix accepts fresh local variables" do
expectChecks (lemmaBlocks "fresh_fix" freshFixLemma freshFixProof)
, testCase "take accepts fresh witnesses" do
expectChecks (lemmaBlocks "fresh_take" freshTakeLemma freshTakeProof)
, testCase "struct axioms recursively rewrite carrier labels" do
text <- encodedTasksText structCarrierRewriteBlocks
assertContains "rewritten struct-rule carrier" "elem(Xx,s__carrier(XA))" text
assertNotContains "raw struct-rule carrier" "elem(Xx,XA)" text
, testCase "struct axioms annotate operations from the same structure" do
text <- encodedTasksText structOperationRewriteBlocks
assertContains "annotated struct operation in rule" "elem(s__fooop(XA),s__carrier(XA))" text
, testCase "exact structure claims introduce carrier labels for continuations" do
text <- encodedTasksText structClaimIntroducesContextBlocks
assertContains "claim continuation carrier" "conjecture,elem(fx,s__carrier(fA))" text
, testCase "bound variables do not inherit outer carrier labels" do
text <- encodedTasksText boundStructLabelBlocks
assertContains "bound carrier label remains raw" "![XA]:elem(fx,XA)" text
assertNotContains "bound carrier label not rewritten" "![XA]:elem(fx,s__carrier(XA))" text
]
expectChecks :: [Block] -> Assertion
expectChecks blocks = do
_tasks <- check WithoutDumpPremselTraining blocks
pure ()
encodedTasksText :: [Block] -> IO Text
encodedTasksText blocks = do
tasks <- check WithoutDumpPremselTraining blocks
if null tasks
then assertFailure "expected at least one generated task"
else pure ()
pure (Text.intercalate "\n------------------\n" (encodeTaskText <$> tasks))
expectCheckingError :: Text -> [Block] -> Assertion
expectCheckingError fragment blocks = do
result <- try (check WithoutDumpPremselTraining blocks) :: IO (Either CheckingError [Task])
case result of
Right _ ->
assertFailure "expected a CheckingError, but checking succeeded"
Left err@(CheckingError msg _ _) ->
assertBool ("expected error containing " <> show fragment <> ", got " <> show err) (fragment `Text.isInfixOf` msg)
Left err ->
assertFailure ("expected generic CheckingError, got " <> show err)
assertContains :: String -> Text -> Text -> Assertion
assertContains label needle haystack =
assertBool (label <> ": expected to find " <> show needle <> " in " <> Text.unpack haystack) (needle `Text.isInfixOf` haystack)
assertNotContains :: String -> Text -> Text -> Assertion
assertNotContains label needle haystack =
assertBool (label <> ": expected not to find " <> show needle <> " in " <> Text.unpack haystack) (not (needle `Text.isInfixOf` haystack))
lemmaBlocks :: Marker -> Lemma -> Proof -> [Block]
lemmaBlocks marker lemma proof =
[BlockLemma Nowhere marker lemma, BlockProof Nowhere Nowhere proof]
badFixLemma :: Lemma
badFixLemma =
Lemma [Asm (var "a" `eq` var "b")] (makeForall ["x"] (var "x" `eq` var "b"))
badFixProof :: Proof
badFixProof =
Fix Nowhere ("a" :| []) Top (Qed (Just Nowhere) JustificationLocal)
badDefineLemma :: Lemma
badDefineLemma =
Lemma [] (makeForall ["x"] (var "x" `eq` emptySet))
badDefineProof :: Proof
badDefineProof =
Fix Nowhere ("x" :| []) Top (Define Nowhere "x" emptySet (Qed (Just Nowhere) JustificationLocal))
badTakeLemma :: Lemma
badTakeLemma =
Lemma [Asm (makeExists ["x"] (var "x" `neq` var "b"))] (var "a" `neq` var "b")
badTakeProof :: Proof
badTakeProof =
Take Nowhere ("a" :| []) (var "a" `neq` var "b") JustificationLocal (Qed (Just Nowhere) JustificationLocal)
badHaveLemma :: Lemma
badHaveLemma =
Lemma [] Top
badHaveProof :: Proof
badHaveProof =
Have Nowhere (var "c" `eq` var "c") JustificationEmpty (Qed (Just Nowhere) JustificationEmpty)
badDefineFunctionNameLemma :: Lemma
badDefineFunctionNameLemma =
Lemma [] (var "f" `eq` var "f")
badDefineFunctionNameProof :: Proof
badDefineFunctionNameProof =
DefineFunction Nowhere "f" "x" (var "x") emptySet (Qed (Just Nowhere) JustificationLocal)
badDefineFunctionArgLemma :: Lemma
badDefineFunctionArgLemma =
Lemma [] (var "x" `eq` var "x")
badDefineFunctionArgProof :: Proof
badDefineFunctionArgProof =
DefineFunction Nowhere "f" "x" (var "x") emptySet (Qed (Just Nowhere) JustificationLocal)
freeGoalLocalLemma :: Lemma
freeGoalLocalLemma =
Lemma [] (var "b" `eq` var "b")
freeGoalLocalProof :: Proof
freeGoalLocalProof =
Qed (Just Nowhere) JustificationEmpty
freshFixLemma :: Lemma
freshFixLemma =
Lemma [] (makeForall ["x"] (var "x" `eq` var "x"))
freshFixProof :: Proof
freshFixProof =
Fix Nowhere ("x" :| []) Top (Qed (Just Nowhere) JustificationEmpty)
freshTakeLemma :: Lemma
freshTakeLemma =
Lemma [Asm (makeExists ["x"] (var "x" `eq` var "b"))] (var "b" `eq` var "b")
freshTakeProof :: Proof
freshTakeProof =
Take Nowhere ("y" :| []) (var "y" `eq` var "b") JustificationLocal (Qed (Just Nowhere) JustificationEmpty)
structCarrierRewriteBlocks :: [Block]
structCarrierRewriteBlocks =
[ fooStructBlock "foo_struct" [("foo_rule", makeForall ["x"] ((var "x" `isElementOf` var "A") `Implies` (var "x" `isElementOf` var "A")))]
, BlockLemma Nowhere "foo_test" (Lemma [AsmStruct "A" fooStruct, Asm (var "x" `isElementOf` var "A")] (var "x" `isElementOf` var "A"))
, BlockProof Nowhere Nowhere (Qed (Just Nowhere) (JustificationRef ("foo_rule" :| [])))
]
structOperationRewriteBlocks :: [Block]
structOperationRewriteBlocks =
[ fooStructBlock "foo_op_struct" [("foo_op_rule", TermSymbolStruct fooOp Nothing `isElementOf` var "A")]
, BlockLemma Nowhere "foo_op_test" (Lemma [AsmStruct "A" fooStruct] (TermSymbolStruct fooOp Nothing `isElementOf` var "A"))
, BlockProof Nowhere Nowhere (Qed (Just Nowhere) (JustificationRef ("foo_op_rule" :| [])))
]
structClaimIntroducesContextBlocks :: [Block]
structClaimIntroducesContextBlocks =
[ fooStructBlock "foo_claim_struct" []
, BlockLemma Nowhere "foo_claim_test" (Lemma [] ((var "A" `eq` var "A") `And` (var "x" `eq` var "x")))
, BlockProof Nowhere Nowhere $
Have Nowhere (fooStructPredicate "A") JustificationEmpty $
Have Nowhere (var "x" `isElementOf` var "A") JustificationEmpty Omitted
]
boundStructLabelBlocks :: [Block]
boundStructLabelBlocks =
[ fooStructBlock "foo_bound_struct" []
, BlockLemma Nowhere "foo_bound_test" (Lemma [AsmStruct "A" fooStruct] (makeForall ["A"] (var "x" `isElementOf` var "A")))
, BlockProof Nowhere Nowhere (Qed (Just Nowhere) JustificationEmpty)
]
fooStructBlock :: Marker -> [(Marker, Formula)] -> Block
fooStructBlock marker assumes =
BlockStruct Nowhere marker StructDefn
{ structPhrase = fooStruct
, structParents = Set.singleton _Onesorted
, structDefnLabel = "A"
, structDefnFixes = Set.singleton fooOp
, structDefnAssumes = assumes
}
fooStruct :: StructPhrase
fooStruct =
mkLexicalItemSgPl (unsafeReadPhraseSgPl "foo[/s]") "foo"
fooOp :: StructSymbol
fooOp =
StructSymbol "fooop"
fooStructPredicate :: VarSymbol -> Formula
fooStructPredicate x =
TermSymbol Nowhere (SymbolPredicate (PredicateNounStruct fooStruct)) [TermVar x]
var :: VarSymbol -> Term
var = TermVar
emptySet :: Term
emptySet = EmptySet Nowhere
eq :: Term -> Term -> Formula
eq = Equals Nowhere
neq :: Term -> Term -> Formula
neq = NotEquals Nowhere
|
