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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
|
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE NoImplicitPrelude #-}
-- | Private in-memory proof trees and independent kernel replay.
module Felix.Checking.Kernel.Derivation
( ImportIx
, importIx
, importIxValue
, HypothesisIx
, hypothesisIx
, DerivationImportJudgment
, derivationImportJudgment
, derivationImportStatement
, KernelDerivation
, mapKernelDerivationGlobals
, importedFactDerivation
, localHypothesisDerivation
, foundationFactDerivation
, implicationEliminationDerivation
, forallEliminationDerivation
, falsumEliminationDerivation
, implicationIntroductionDerivation
, forallIntroductionDerivation
, ConversionPlan
, conversionPlan
, conversionPlanBudget
, ConversionPlanError(..)
, convertJudgmentDerivation
, equalityReflexivityDerivation
, scopedEqualityReflexivityDerivation
, equalityCongruenceApplicationDerivation
, equalityCongruenceLambdaDerivation
, equalityModusPonensDerivation
, setLfpBoundDerivation
, setLfpLeastDerivation
, setLfpFixedDerivation
, setLfpInductDerivation
, weakenDerivationHypotheses
, KernelReplayLimits
, kernelReplayLimits
, defaultKernelReplayLimits
, KernelReplayLimitError(..)
, ReplayedKernelDerivation
, replayKernelDerivation
, replayedKernelTarget
, replayedKernelImportUses
, replayedKernelFoundationUses
, replayedKernelRuleUses
, replayedKernelNodeCount
, replayedKernelMaximumDepth
, DerivationImportError(..)
, KernelReplayError(..)
) where
import Base
import Felix.Checking.Core
import Felix.Checking.Foundation
import Felix.Checking.Kernel.Semantics qualified as Semantics
import Felix.Checking.Kernel.SetLfp qualified as SetLfp
import Control.Monad (unless)
import Data.Bifunctor (first)
import Data.Set qualified as Set
import Data.Vector (Vector)
import Data.Vector qualified as Vector
import Numeric.Natural (Natural)
newtype ImportIx = ImportIx Natural
deriving stock (Show, Eq, Ord)
importIx :: Natural -> ImportIx
importIx = ImportIx
importIxValue :: ImportIx -> Natural
importIxValue (ImportIx index) =
index
newtype HypothesisIx = HypothesisIx Natural
deriving stock (Show, Eq, Ord)
hypothesisIx :: Natural -> HypothesisIx
hypothesisIx = HypothesisIx
newtype DerivationImportJudgment global =
DerivationImportJudgment
(FrozenCheckedCore global)
deriving stock (Eq)
data DerivationImportError =
DerivationImportIsNotProposition !CoreType
deriving stock (Show, Eq)
derivationImportJudgment
:: FrozenCheckedCore global
-> Either
DerivationImportError
(DerivationImportJudgment global)
derivationImportJudgment statement
| frozenCoreType statement == TyProp =
Right (DerivationImportJudgment statement)
| otherwise =
Left
(DerivationImportIsNotProposition
(frozenCoreType statement))
derivationImportStatement
:: DerivationImportJudgment global
-> FrozenCheckedCore global
derivationImportStatement
(DerivationImportJudgment statement) =
statement
data KernelDerivation global
= UseImportedFact !ImportIx
| UseLocalHypothesis !HypothesisIx
| UseFoundationFact !FoundationAxiomTag
| ImplicationElimination
!(KernelDerivation global)
!(KernelDerivation global)
| ForallElimination
!(KernelDerivation global)
!(ScopedCheckedCore global)
| FalsumElimination
!(KernelDerivation global)
!(ScopedCheckedCore global)
| ImplicationIntroduction
!(ScopedCheckedCore global)
!(KernelDerivation global)
| ForallIntroduction
!CoreType
!(KernelDerivation global)
| ConvertJudgment
!(KernelDerivation global)
!(ScopedCheckedCore global)
!ConversionPlan
| EqualityReflexivity
!(ScopedCheckedCore global)
| EqualityCongruenceApplication
!(KernelDerivation global)
!(KernelDerivation global)
| EqualityCongruenceLambda
!CoreType
!(KernelDerivation global)
| EqualityModusPonens
!(KernelDerivation global)
!(KernelDerivation global)
| ApplySetLfpBound
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
| ApplySetLfpLeast
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(KernelDerivation global)
!(KernelDerivation global)
| ApplySetLfpFixed
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(KernelDerivation global)
| ApplySetLfpInduct
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(ScopedCheckedCore global)
!(KernelDerivation global)
!(KernelDerivation global)
!(KernelDerivation global)
deriving stock (Eq)
mapKernelDerivationGlobals
:: (left -> right)
-> KernelDerivation left
-> KernelDerivation right
mapKernelDerivationGlobals transform = go
where
scoped = mapScopedGlobals transform
go = \case
UseImportedFact index ->
UseImportedFact index
UseLocalHypothesis index ->
UseLocalHypothesis index
UseFoundationFact tag ->
UseFoundationFact tag
ImplicationElimination premise implication ->
ImplicationElimination (go premise) (go implication)
ForallElimination proof argument ->
ForallElimination (go proof) (scoped argument)
FalsumElimination proof target ->
FalsumElimination (go proof) (scoped target)
ImplicationIntroduction premise proof ->
ImplicationIntroduction (scoped premise) (go proof)
ForallIntroduction binderType proof ->
ForallIntroduction binderType (go proof)
ConvertJudgment proof target plan ->
ConvertJudgment (go proof) (scoped target) plan
EqualityReflexivity term ->
EqualityReflexivity (scoped term)
EqualityCongruenceApplication function argument ->
EqualityCongruenceApplication (go function) (go argument)
EqualityCongruenceLambda binderType proof ->
EqualityCongruenceLambda binderType (go proof)
EqualityModusPonens equality proof ->
EqualityModusPonens (go equality) (go proof)
ApplySetLfpBound domain operator ->
ApplySetLfpBound (scoped domain) (scoped operator)
ApplySetLfpLeast domain operator candidate bounded closed ->
ApplySetLfpLeast
(scoped domain)
(scoped operator)
(scoped candidate)
(go bounded)
(go closed)
ApplySetLfpFixed domain operator monotone ->
ApplySetLfpFixed
(scoped domain)
(scoped operator)
(go monotone)
ApplySetLfpInduct domain operator predicate element
monotone member closed ->
ApplySetLfpInduct
(scoped domain)
(scoped operator)
(scoped predicate)
(scoped element)
(go monotone)
(go member)
(go closed)
importedFactDerivation
:: ImportIx
-> KernelDerivation global
importedFactDerivation =
UseImportedFact
localHypothesisDerivation
:: HypothesisIx
-> KernelDerivation global
localHypothesisDerivation =
UseLocalHypothesis
foundationFactDerivation
:: FoundationAxiomTag
-> KernelDerivation global
foundationFactDerivation =
UseFoundationFact
implicationEliminationDerivation
:: KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
implicationEliminationDerivation =
ImplicationElimination
forallEliminationDerivation
:: KernelDerivation global
-> ScopedCheckedCore global
-> KernelDerivation global
forallEliminationDerivation =
ForallElimination
falsumEliminationDerivation
:: KernelDerivation global
-> ScopedCheckedCore global
-> KernelDerivation global
falsumEliminationDerivation =
FalsumElimination
implicationIntroductionDerivation
:: ScopedCheckedCore global
-> KernelDerivation global
-> KernelDerivation global
implicationIntroductionDerivation =
ImplicationIntroduction
forallIntroductionDerivation
:: CoreType
-> KernelDerivation global
-> KernelDerivation global
forallIntroductionDerivation =
ForallIntroduction
newtype ConversionPlan = ConversionPlan Natural
deriving stock (Show, Eq, Ord)
data ConversionPlanError =
ConversionPlanExceedsLimit !Natural
deriving stock (Show, Eq)
conversionPlanLimit :: Natural
conversionPlanLimit =
100000
conversionPlan
:: Natural
-> Either ConversionPlanError ConversionPlan
conversionPlan budget
| budget <= conversionPlanLimit =
Right (ConversionPlan budget)
| otherwise =
Left (ConversionPlanExceedsLimit budget)
conversionPlanBudget :: ConversionPlan -> Natural
conversionPlanBudget (ConversionPlan budget) =
budget
convertJudgmentDerivation
:: KernelDerivation global
-> ScopedCheckedCore global
-> ConversionPlan
-> KernelDerivation global
convertJudgmentDerivation =
ConvertJudgment
equalityReflexivityDerivation
:: FrozenCheckedCore global
-> KernelDerivation global
equalityReflexivityDerivation =
EqualityReflexivity . embedClosedCore []
scopedEqualityReflexivityDerivation
:: ScopedCheckedCore global
-> KernelDerivation global
scopedEqualityReflexivityDerivation =
EqualityReflexivity
equalityCongruenceApplicationDerivation
:: KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
equalityCongruenceApplicationDerivation =
EqualityCongruenceApplication
equalityCongruenceLambdaDerivation
:: CoreType
-> KernelDerivation global
-> KernelDerivation global
equalityCongruenceLambdaDerivation =
EqualityCongruenceLambda
equalityModusPonensDerivation
:: KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
equalityModusPonensDerivation =
EqualityModusPonens
setLfpBoundDerivation
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> KernelDerivation global
setLfpBoundDerivation =
ApplySetLfpBound
setLfpLeastDerivation
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> ScopedCheckedCore global
-> KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
setLfpLeastDerivation =
ApplySetLfpLeast
setLfpFixedDerivation
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> KernelDerivation global
-> KernelDerivation global
setLfpFixedDerivation =
ApplySetLfpFixed
setLfpInductDerivation
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> ScopedCheckedCore global
-> ScopedCheckedCore global
-> KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
-> KernelDerivation global
setLfpInductDerivation =
ApplySetLfpInduct
-- | Add hypotheses outside a derivation while preserving hypotheses introduced
-- by implication nodes inside it.
weakenDerivationHypotheses
:: Natural
-> KernelDerivation global
-> KernelDerivation global
weakenDerivationHypotheses amount =
shift 0
where
shift cutoff = \case
UseImportedFact index ->
UseImportedFact index
UseLocalHypothesis (HypothesisIx index) ->
UseLocalHypothesis
(HypothesisIx
(if index >= cutoff
then index + amount
else index))
UseFoundationFact tag ->
UseFoundationFact tag
ImplicationElimination implication premise ->
ImplicationElimination
(shift cutoff implication)
(shift cutoff premise)
ForallElimination quantified argument ->
ForallElimination
(shift cutoff quantified)
argument
FalsumElimination falsum target ->
FalsumElimination
(shift cutoff falsum)
target
ImplicationIntroduction premise body ->
ImplicationIntroduction
premise
(shift (cutoff + 1) body)
ForallIntroduction binderType body ->
ForallIntroduction
binderType
(shift cutoff body)
ConvertJudgment source target plan ->
ConvertJudgment
(shift cutoff source)
target
plan
EqualityReflexivity operand ->
EqualityReflexivity operand
EqualityCongruenceApplication function argument ->
EqualityCongruenceApplication
(shift cutoff function)
(shift cutoff argument)
EqualityCongruenceLambda binderType body ->
EqualityCongruenceLambda
binderType
(shift cutoff body)
EqualityModusPonens equality premise ->
EqualityModusPonens
(shift cutoff equality)
(shift cutoff premise)
ApplySetLfpBound domain operator ->
ApplySetLfpBound domain operator
ApplySetLfpLeast
domain operator candidate
closed bounded ->
ApplySetLfpLeast
domain
operator
candidate
(shift cutoff closed)
(shift cutoff bounded)
ApplySetLfpFixed domain operator monotone ->
ApplySetLfpFixed
domain
operator
(shift cutoff monotone)
ApplySetLfpInduct
domain operator predicate element
monotone member closure ->
ApplySetLfpInduct
domain
operator
predicate
element
(shift cutoff monotone)
(shift cutoff member)
(shift cutoff closure)
data KernelReplayLimits = KernelReplayLimits
!Natural
!Natural
deriving stock (Show, Eq)
data KernelReplayLimitError
= KernelReplayNodeLimitIsZero
| KernelReplayNodeLimitTooLarge !Natural
| KernelReplayDepthLimitTooLarge !Natural
deriving stock (Show, Eq)
maximumKernelReplayNodes :: Natural
maximumKernelReplayNodes =
1000000
maximumKernelReplayDepth :: Natural
maximumKernelReplayDepth =
4096
kernelReplayLimits
:: Natural
-> Natural
-> Either KernelReplayLimitError KernelReplayLimits
kernelReplayLimits nodeLimit depthLimit
| nodeLimit == 0 =
Left KernelReplayNodeLimitIsZero
| nodeLimit > maximumKernelReplayNodes =
Left (KernelReplayNodeLimitTooLarge nodeLimit)
| depthLimit > maximumKernelReplayDepth =
Left (KernelReplayDepthLimitTooLarge depthLimit)
| otherwise =
Right
(KernelReplayLimits
nodeLimit
depthLimit)
defaultKernelReplayLimits :: KernelReplayLimits
defaultKernelReplayLimits =
KernelReplayLimits
200000
2048
data ReplayedKernelDerivation global =
ReplayedKernelDerivation
!(FrozenCheckedCore global)
!(Set ImportIx)
!(Set FoundationAxiomTag)
!(Set KernelRuleTag)
!Natural
!Natural
deriving stock (Eq)
replayedKernelTarget
:: ReplayedKernelDerivation global
-> FrozenCheckedCore global
replayedKernelTarget
(ReplayedKernelDerivation
target
_importUses
_foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
target
replayedKernelImportUses
:: ReplayedKernelDerivation global
-> Set ImportIx
replayedKernelImportUses
(ReplayedKernelDerivation
_target
importUses
_foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
importUses
replayedKernelFoundationUses
:: ReplayedKernelDerivation global
-> Set FoundationAxiomTag
replayedKernelFoundationUses
(ReplayedKernelDerivation
_target
_importUses
foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
foundationUses
replayedKernelRuleUses
:: ReplayedKernelDerivation global
-> Set KernelRuleTag
replayedKernelRuleUses
(ReplayedKernelDerivation
_target
_importUses
_foundationUses
ruleUses
_nodeCount
_maximumDepth) =
ruleUses
replayedKernelNodeCount
:: ReplayedKernelDerivation global
-> Natural
replayedKernelNodeCount
(ReplayedKernelDerivation
_target
_importUses
_foundationUses
_ruleUses
nodeCount
_maximumDepth) =
nodeCount
replayedKernelMaximumDepth
:: ReplayedKernelDerivation global
-> Natural
replayedKernelMaximumDepth
(ReplayedKernelDerivation
_target
_importUses
_foundationUses
_ruleUses
_nodeCount
maximumDepth) =
maximumDepth
data ReplayStep global = ReplayStep
!(ScopedCheckedCore global)
!(Set ImportIx)
!(Set FoundationAxiomTag)
!(Set KernelRuleTag)
!Natural
!Natural
data KernelReplayError
= KernelReplaySemanticsError
!Semantics.KernelSemanticsError
| KernelReplaySetLfpRuleError
!SetLfp.SetLfpRuleError
| KernelReplayImportOutOfBounds !ImportIx
| KernelReplayHypothesisOutOfBounds !HypothesisIx
| KernelReplayStoredContextMismatch
![CoreType]
![CoreType]
| KernelReplayStoredTermIllTyped !CoreCheckError
| KernelReplayStoredTypeMismatch
!CoreType
!CoreType
| KernelReplayWeakeningError !CoreCheckError
| KernelReplayNodeLimitExceeded !Natural
| KernelReplayDepthLimitExceeded !Natural
| KernelReplayRootRemainedOpen
| KernelReplayTargetMismatch
deriving stock (Show, Eq)
replayKernelDerivation
:: Eq global
=> CheckedFoundation
-> KernelReplayLimits
-> (global -> Maybe CoreType)
-> Vector (DerivationImportJudgment global)
-> FrozenCheckedCore global
-> KernelDerivation global
-> Either
KernelReplayError
(ReplayedKernelDerivation global)
replayKernelDerivation
checkedFoundationValue
limits
globalType
imports
expectedTarget
derivation =
checkedFoundationValue `seq` do
expectedTarget' <-
recheckClosed expectedTarget
ReplayStep
synthesized
importUses
foundationUses
ruleUses
nodeCount
maximumDepth <-
replay [] [] 0 derivation
closed <-
maybe
(Left KernelReplayRootRemainedOpen)
Right
(closeScopedCore synthesized)
unless
(closed == expectedTarget')
(Left KernelReplayTargetMismatch)
pure
(ReplayedKernelDerivation
closed
importUses
foundationUses
ruleUses
nodeCount
maximumDepth)
where
replay context hypotheses depth derivationNode
| depth > replayDepthLimit =
Left
(KernelReplayDepthLimitExceeded
replayDepthLimit)
| otherwise = do
step <-
replayWithin
context
hypotheses
depth
derivationNode
if stepNodeCount step > replayNodeLimit
then
Left
(KernelReplayNodeLimitExceeded
replayNodeLimit)
else
Right step
replayWithin context hypotheses depth = \case
UseImportedFact index -> do
judgment <-
lookupImport index
statement <-
recheckStored
context
(embedClosedCore context
(derivationImportStatement
judgment))
pure
(leaf
depth
statement
(Set.singleton index)
mempty)
UseLocalHypothesis index -> do
hypothesis <-
lookupHypothesis index hypotheses
checkedHypothesis <-
recheckStored context hypothesis
pure
(leaf
depth
checkedHypothesis
mempty
mempty)
UseFoundationFact tag -> do
statement <-
recheckStored
context
(embedClosedCore context
(mapFrozenGlobals
absurd
(foundationAxiomFrozen
checkedFoundationValue
tag)))
pure
(leaf
depth
statement
mempty
(Set.singleton tag))
ImplicationElimination implication premise -> do
implicationStep <-
replay context hypotheses (depth + 1) implication
premiseStep <-
replay context hypotheses (depth + 1) premise
combine2 depth
(Semantics.implicationElimination
globalType
(stepValue implicationStep)
(stepValue premiseStep))
implicationStep
premiseStep
ForallElimination quantified argument -> do
argument' <-
recheckStored context argument
quantifiedStep <-
replay context hypotheses (depth + 1) quantified
combine1 depth
(Semantics.forallElimination
globalType
(stepValue quantifiedStep)
argument')
quantifiedStep
FalsumElimination falsum target -> do
target' <-
recheckStored context target
falsumStep <-
replay context hypotheses (depth + 1) falsum
combine1 depth
(Semantics.falsumElimination
globalType
(stepValue falsumStep)
target')
falsumStep
ImplicationIntroduction premise body -> do
premise' <-
recheckStored context premise
bodyStep <-
replay
context
(premise' : hypotheses)
(depth + 1)
body
combine1 depth
(Semantics.implicationIntroduction
globalType
premise'
(stepValue bodyStep))
bodyStep
ForallIntroduction binderType body -> do
weakenedHypotheses <-
traverse
(first KernelReplayWeakeningError
. weakenScopedCore
globalType
binderType)
hypotheses
bodyStep <-
replay
(binderType : context)
weakenedHypotheses
(depth + 1)
body
combine1 depth
(Semantics.forallIntroduction
globalType
binderType
(stepValue bodyStep))
bodyStep
ConvertJudgment source target plan -> do
target' <-
recheckStored context target
sourceStep <-
replay
context
hypotheses
(depth + 1)
source
combine1 depth
(Semantics.convertJudgment
globalType
(conversionPlanBudget plan)
(stepValue sourceStep)
target')
sourceStep
EqualityReflexivity operand -> do
operand' <-
recheckStored context operand
value <-
first KernelReplaySemanticsError
(Semantics.equalityReflexivity
globalType
operand')
pure (leaf depth value mempty mempty)
EqualityCongruenceApplication
functionEquality
argumentEquality -> do
functionStep <-
replay
context
hypotheses
(depth + 1)
functionEquality
argumentStep <-
replay
context
hypotheses
(depth + 1)
argumentEquality
combine2 depth
(Semantics.equalityCongruenceApplication
globalType
(stepValue functionStep)
(stepValue argumentStep))
functionStep
argumentStep
EqualityCongruenceLambda binderType bodyEquality -> do
weakenedHypotheses <-
traverse
(first KernelReplayWeakeningError
. weakenScopedCore
globalType
binderType)
hypotheses
bodyStep <-
replay
(binderType : context)
weakenedHypotheses
(depth + 1)
bodyEquality
combine1 depth
(Semantics.equalityCongruenceLambda
globalType
binderType
(stepValue bodyStep))
bodyStep
EqualityModusPonens equality premise -> do
equalityStep <-
replay context hypotheses (depth + 1) equality
premiseStep <-
replay context hypotheses (depth + 1) premise
combine2 depth
(Semantics.equalityModusPonens
globalType
(stepValue equalityStep)
(stepValue premiseStep))
equalityStep
premiseStep
ApplySetLfpBound domain operator -> do
domain' <-
recheckStored context domain
operator' <-
recheckStored context operator
value <-
first KernelReplaySetLfpRuleError
(SetLfp.setLfpBound
checkedFoundationValue
globalType
domain'
operator')
pure
(ruleLeaf
depth
SetLfpBound
value)
ApplySetLfpLeast
domain
operator
candidate
closedPremise
boundedPremise -> do
domain' <-
recheckStored context domain
operator' <-
recheckStored context operator
candidate' <-
recheckStored context candidate
closedStep <-
replay
context
hypotheses
(depth + 1)
closedPremise
boundedStep <-
replay
context
hypotheses
(depth + 1)
boundedPremise
combineRule depth SetLfpLeast
(SetLfp.setLfpLeast
checkedFoundationValue
globalType
domain'
operator'
candidate'
(stepValue closedStep)
(stepValue boundedStep))
[closedStep, boundedStep]
ApplySetLfpFixed domain operator monotonePremise -> do
domain' <-
recheckStored context domain
operator' <-
recheckStored context operator
monotoneStep <-
replay
context
hypotheses
(depth + 1)
monotonePremise
combineRule depth SetLfpFixed
(SetLfp.setLfpFixed
checkedFoundationValue
globalType
domain'
operator'
(stepValue monotoneStep))
[monotoneStep]
ApplySetLfpInduct
domain
operator
predicate
element
monotonePremise
memberPremise
closurePremise -> do
domain' <-
recheckStored context domain
operator' <-
recheckStored context operator
predicate' <-
recheckStored context predicate
element' <-
recheckStored context element
monotoneStep <-
replay
context
hypotheses
(depth + 1)
monotonePremise
memberStep <-
replay
context
hypotheses
(depth + 1)
memberPremise
closureStep <-
replay
context
hypotheses
(depth + 1)
closurePremise
combineRule depth SetLfpInduct
(SetLfp.setLfpInduct
checkedFoundationValue
globalType
domain'
operator'
predicate'
element'
(stepValue monotoneStep)
(stepValue memberStep)
(stepValue closureStep))
[ monotoneStep
, memberStep
, closureStep
]
lookupImport index@(ImportIx naturalIndex)
| naturalIndex
> fromIntegral (maxBound :: Int) =
Left
(KernelReplayImportOutOfBounds
index)
| otherwise =
maybe
(Left
(KernelReplayImportOutOfBounds
index))
Right
(imports
Vector.!?
(fromIntegral naturalIndex))
lookupHypothesis
index@(HypothesisIx naturalIndex)
hypotheses =
maybe
(Left
(KernelReplayHypothesisOutOfBounds
index))
Right
(atNatural naturalIndex hypotheses)
requireContext expected value
| scopedCoreContext value == expected =
Right ()
| otherwise =
Left
(KernelReplayStoredContextMismatch
expected
(scopedCoreContext value))
recheckStored expectedContext stored = do
requireContext expectedContext stored
checked <-
first KernelReplayStoredTermIllTyped
(checkScopedCanonicalCore
globalType
expectedContext
(scopedCoreTerm stored))
unless
(scopedCoreType checked
== scopedCoreType stored)
(Left
(KernelReplayStoredTypeMismatch
(scopedCoreType stored)
(scopedCoreType checked)))
pure checked
recheckClosed stored = do
checked <-
first KernelReplayStoredTermIllTyped
(checkCanonicalCore
globalType
(frozenCoreTerm stored))
unless
(frozenCoreType checked
== frozenCoreType stored)
(Left
(KernelReplayStoredTypeMismatch
(frozenCoreType stored)
(frozenCoreType checked)))
pure checked
replayNodeLimit =
case limits of
KernelReplayLimits nodeLimit _depthLimit ->
nodeLimit
replayDepthLimit =
case limits of
KernelReplayLimits _nodeLimit depthLimit ->
depthLimit
leaf
:: Natural
-> ScopedCheckedCore global
-> Set ImportIx
-> Set FoundationAxiomTag
-> ReplayStep global
leaf depth value importUses foundationUses =
ReplayStep
value
importUses
foundationUses
mempty
1
depth
ruleLeaf
:: Natural
-> KernelRuleTag
-> ScopedCheckedCore global
-> ReplayStep global
ruleLeaf depth tag value =
ReplayStep
value
mempty
mempty
(Set.singleton tag)
1
depth
stepValue :: ReplayStep global -> ScopedCheckedCore global
stepValue
(ReplayStep
value
_importUses
_foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
value
combine1
:: Natural
-> Either
Semantics.KernelSemanticsError
(ScopedCheckedCore global)
-> ReplayStep global
-> Either KernelReplayError (ReplayStep global)
combine1 depth synthesized child = do
value <-
first KernelReplaySemanticsError synthesized
pure
(ReplayStep
value
(stepImportUses child)
(stepFoundationUses child)
(stepRuleUses child)
(1 + stepNodeCount child)
(max depth
(stepMaximumDepth child)))
combine2
:: Natural
-> Either
Semantics.KernelSemanticsError
(ScopedCheckedCore global)
-> ReplayStep global
-> ReplayStep global
-> Either KernelReplayError (ReplayStep global)
combine2 depth synthesized left right = do
value <-
first KernelReplaySemanticsError synthesized
pure
(ReplayStep
value
(stepImportUses left
<> stepImportUses right)
(stepFoundationUses left
<> stepFoundationUses right)
(stepRuleUses left
<> stepRuleUses right)
(1
+ stepNodeCount left
+ stepNodeCount right)
(maximum
[ depth
, stepMaximumDepth left
, stepMaximumDepth right
]))
combineRule
:: Natural
-> KernelRuleTag
-> Either
SetLfp.SetLfpRuleError
(ScopedCheckedCore global)
-> [ReplayStep global]
-> Either KernelReplayError (ReplayStep global)
combineRule depth tag synthesized children = do
value <-
first KernelReplaySetLfpRuleError synthesized
pure
(ReplayStep
value
(foldMap stepImportUses children)
(foldMap stepFoundationUses children)
(Set.insert tag
(foldMap stepRuleUses children))
(1 + sum (stepNodeCount <$> children))
(maximum
(depth
: (stepMaximumDepth <$> children))))
stepImportUses
:: ReplayStep global
-> Set ImportIx
stepImportUses
(ReplayStep
_value
importUses
_foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
importUses
stepFoundationUses
:: ReplayStep global
-> Set FoundationAxiomTag
stepFoundationUses
(ReplayStep
_value
_importUses
foundationUses
_ruleUses
_nodeCount
_maximumDepth) =
foundationUses
stepRuleUses
:: ReplayStep global
-> Set KernelRuleTag
stepRuleUses
(ReplayStep
_value
_importUses
_foundationUses
ruleUses
_nodeCount
_maximumDepth) =
ruleUses
stepNodeCount :: ReplayStep global -> Natural
stepNodeCount
(ReplayStep
_value
_importUses
_foundationUses
_ruleUses
nodeCount
_maximumDepth) =
nodeCount
stepMaximumDepth :: ReplayStep global -> Natural
stepMaximumDepth
(ReplayStep
_value
_importUses
_foundationUses
_ruleUses
_nodeCount
maximumDepth) =
maximumDepth
atNatural :: Natural -> [a] -> Maybe a
atNatural _index [] =
Nothing
atNatural 0 (value : _rest) =
Just value
atNatural index (_value : rest) =
atNatural (index - 1) rest
|