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
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
|
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE NoImplicitPrelude #-}
-- | Exact lowering for the first ordinary theorem/proof fragment.
--
-- This module is the trusted owner of structural local-proof composition. Its
-- private prepared tree controls when assumptions and proved local claims
-- become available and executes discharges depth-first. The declaration
-- boundary validates typed tasks and authority; it does not reconstruct this
-- derivation.
module Felix.Checking.Exact.Proof
( PreparedExactProof
, preparedExactProofSyntaxId
, preparedExactProofFirstOmission
, prepareExactProof
, CheckedExactProofAuthorization
, lowerPreparedExactProof
, authorizeCheckedExactProof
, PreparedFinalPreludeFoundationClaim
, prepareFinalPreludeFoundationClaim
, CheckedFinalPreludeFoundationAuthorization
, lowerPreparedFinalPreludeFoundationClaim
, authorizeCheckedFinalPreludeFoundationClaim
, ExactProofError(..)
, exactProofErrorLocation
, renderExactProofError
) where
import Base
import Felix.Checking.Authority qualified as Authority
import Felix.Checking.Backend.Problem qualified as Backend
import Felix.Checking.Core
import Felix.Checking.Declaration qualified as Declaration
import Felix.Checking.Exact qualified as Exact
import Felix.Checking.Foundation
import Felix.Checking.Identity
import Felix.Checking.Kernel.Derivation (foundationFactDerivation)
import Felix.Checking.Kernel.Proof qualified as KernelProof
import Felix.Checking.SetConstruction
import Felix.Checking.Semantic
import Felix.Cache.Codec
import Felix.Report.Location
import Felix.Syntax.Abstract qualified as Raw
import Control.Monad.Except (ExceptT)
import Control.Monad.Except qualified as Except
import Control.Monad (foldM, unless, when)
import Control.Monad.State.Strict (StateT)
import Control.Monad.State.Strict qualified as State
import Data.ByteString (ByteString)
import Data.List.NonEmpty qualified as NonEmpty
import Data.Map.Strict qualified as Map
import Data.Set qualified as Set
import Data.Text qualified as Text
import Data.Vector (Vector)
import Data.Vector qualified as Vector
import Numeric.Natural (Natural)
data ExactProofError
= ExactProofUnsupportedClaim !Location
| ExactProofUnsupportedStep !Location
| ExactProofSetInductionVariableRequired !Location
| ExactProofSetInductionVariableNotActive
!Location !Raw.VarSymbol
| ExactProofSetInductionFocusAmbiguous !Location
| ExactProofSetInductionActiveBinderIneligible
!Location !Raw.VarSymbol
| ExactProofSetInductionBinderConflict
!Location !Raw.VarSymbol
| ExactProofSetInductionGoalMismatch !Location
| ExactProofSetExtensionalityGoalMismatch !Location
| ExactProofSetExtensionalityDirectionsUnavailable !Location
| ExactProofExpectedUniversalGoal !Location
| ExactProofExpectedImplicationGoal !Location
| ExactProofGoalStatementMismatch !Location
| ExactProofEmptyCaseSplit !Location
| ExactProofStructuralCompositionFailed
!Location !KernelProof.KernelProofBuildError
| ExactProofLocalFunctionBinderMismatch !Location
| ExactProofLocalFunctionNameConflict !Location
| ExactProofUnknownReference !Location !Raw.Marker
| ExactProofElaborationFailed !Exact.ExactCompileError
| ExactProofObligationPreparationFailed
!Location
!(Declaration.VampireObligationPreparationError
Exact.ExactLocalId)
| ExactProofFoundationLeafRequiresImplicitAuto !Location
| ExactProofFoundationLeafTargetMismatch !Location
| ExactProofFoundationLeafTargetAmbiguous !Location
deriving stock (Show, Eq)
exactProofErrorLocation :: ExactProofError -> Location
exactProofErrorLocation = \case
ExactProofUnsupportedClaim location -> location
ExactProofUnsupportedStep location -> location
ExactProofSetInductionVariableRequired location -> location
ExactProofSetInductionVariableNotActive location _variable ->
location
ExactProofSetInductionFocusAmbiguous location -> location
ExactProofSetInductionActiveBinderIneligible location _variable ->
location
ExactProofSetInductionBinderConflict location _variable ->
location
ExactProofSetInductionGoalMismatch location -> location
ExactProofSetExtensionalityGoalMismatch location -> location
ExactProofSetExtensionalityDirectionsUnavailable location -> location
ExactProofExpectedUniversalGoal location -> location
ExactProofExpectedImplicationGoal location -> location
ExactProofGoalStatementMismatch location -> location
ExactProofEmptyCaseSplit location -> location
ExactProofStructuralCompositionFailed location _failure -> location
ExactProofLocalFunctionBinderMismatch location -> location
ExactProofLocalFunctionNameConflict location -> location
ExactProofUnknownReference location _marker -> location
ExactProofElaborationFailed failure ->
Exact.exactCompileErrorLocation failure
ExactProofObligationPreparationFailed location _failure -> location
ExactProofFoundationLeafRequiresImplicitAuto location -> location
ExactProofFoundationLeafTargetMismatch location -> location
ExactProofFoundationLeafTargetAmbiguous location -> location
renderExactProofError :: ExactProofError -> Text
renderExactProofError = \case
ExactProofUnsupportedClaim location ->
at location <> "this claim is not yet supported by the typed checker"
ExactProofUnsupportedStep location ->
at location <> "this proof step is not yet supported by the typed checker"
ExactProofSetInductionVariableRequired location ->
at location <> "exact set induction requires a named set variable"
ExactProofSetInductionVariableNotActive location variable ->
at location <> "the set-induction variable " <> shown variable
<> " is not an eligible exact focus"
ExactProofSetInductionFocusAmbiguous location ->
at location
<> "set induction without an explicit variable has no unique focus"
ExactProofSetInductionActiveBinderIneligible location variable ->
at location <> "the active binder " <> shown variable
<> " is not an eligible set-induction focus"
ExactProofSetInductionBinderConflict location variable ->
at location <> "the leading set-induction binder " <> shown variable
<> " conflicts with an active exact binder"
ExactProofSetInductionGoalMismatch location ->
at location <> "the set-induction variable does not belong to this goal"
ExactProofSetExtensionalityGoalMismatch location ->
at location <> "set extensionality requires a set-equality goal"
ExactProofSetExtensionalityDirectionsUnavailable location ->
at location
<> "set extensionality requires both directions as proved local claims"
ExactProofExpectedUniversalGoal location ->
at location <> "this fix step requires a universal goal"
ExactProofExpectedImplicationGoal location ->
at location <> "this assume step requires an implication goal"
ExactProofGoalStatementMismatch location ->
at location <> "the proof step does not match the current goal"
ExactProofEmptyCaseSplit location ->
at location <> "case analysis requires at least one case"
ExactProofStructuralCompositionFailed location failure ->
at location <> "invalid structural proof composition: " <> shown failure
ExactProofLocalFunctionBinderMismatch location ->
at location <> "the function argument must match its domain binder"
ExactProofLocalFunctionNameConflict location ->
at location <> "the function and argument names must be distinct"
ExactProofUnknownReference location marker ->
at location <> "the cited fact " <> shown marker <> " is not visible"
ExactProofElaborationFailed failure ->
Exact.renderExactCompileError failure
ExactProofObligationPreparationFailed location failure ->
at location <> "the exact proof obligation is invalid: " <> shown failure
ExactProofFoundationLeafRequiresImplicitAuto location ->
at location
<> "a confined foundation claim requires an implicit Auto proof"
ExactProofFoundationLeafTargetMismatch location ->
at location <> "the claim does not exactly match a foundation axiom"
ExactProofFoundationLeafTargetAmbiguous location ->
at location <> "the claim matches more than one foundation axiom"
where
at location = locationToText location <> ": "
shown :: Show value => value -> Text
shown = Text.pack . show
data ExactLocalOrigin
= ExactAssumption
| ExactDerivedClaim
| ExactLocalDefinition
| ExactLocalConstructionExtensional
| ExactLocalConstructionEquation
deriving stock (Show, Eq, Ord)
data PreparedLocal = PreparedLocal
!Backend.LocalPremiseOrdinal
!ExactLocalOrigin
!(Vector (Exact.ExactLocalId, CoreType))
!(ScopedCheckedCore ObjectId)
data PreparedJustification
= PreparedAuto
| PreparedReferences
!(NonEmpty SemanticFactOccurrenceFingerprint)
| PreparedLocalOnly
data PreparedDischarge
= PreparedVampireDischarge
!Location
!PreparedJustification
!(ScopedCheckedCore ObjectId)
!(Declaration.PreparedVampireObligation
Exact.ExactLocalId
ExactLocalOrigin)
| PreparedSetExtensionality
!Location
!(ScopedCheckedCore ObjectId)
data PreparedCalculationLink = PreparedCalculationLink
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
-- The private constructor stores every destination with the discharge derived
-- from its immediately preceding endpoint. Planning and admission can
-- therefore traverse one immutable sequence without re-associating shapes.
data PreparedCalculation = PreparedCheckedCalculation
!CoreType
![Exact.ExactLocalId]
!(Maybe (ScopedCheckedCore ObjectId))
!(ScopedCheckedCore ObjectId)
!(NonEmpty PreparedCalculationLink)
!(ScopedCheckedCore ObjectId)
data PreparedSinceEvidence
= PreparedSinceExisting !PreparedLocal
| PreparedSinceDischarged !PreparedDischarge !PreparedLocal
data PreparedCase = PreparedCase
!(ScopedCheckedCore ObjectId)
!PreparedProof
data PreparedCaseAnalysis = PreparedCaseAnalysis
!(ScopedCheckedCore ObjectId)
!(NonEmpty PreparedCase)
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
data InitialSetInductionFocus = InitialSetInductionFocus
!Raw.VarSymbol
!Exact.ExactLocalId
!Natural
data InitialSetInductionView = InitialSetInductionView
![InitialSetInductionFocus]
!(Vector (Exact.ExactLocalId, CoreType))
!(ScopedCheckedCore ObjectId)
![ScopedCheckedCore ObjectId]
!(ScopedCheckedCore ObjectId)
!(Maybe Raw.VarSymbol)
data SetInductionBoundary
= InitialClaimInduction !InitialSetInductionView
-- A direct source-statement goal may retain only its leading binder name.
-- Recursive proof transformations deliberately discard this hint.
| SourceStatementInduction !(Maybe Raw.VarSymbol)
| RecursiveProofInduction
data SelectedSetInductionFocus
= SelectedInitialSetInduction !InitialSetInductionFocus
| SelectedLeadingSetInduction !(Maybe Raw.VarSymbol)
data PreparedSetInductionFocus
= PreparedInitialSetInductionFocus
!Exact.ExactLocalId
!Natural
| PreparedLeadingSetInductionFocus
!Exact.ExactLocalId
data PreparedSetInduction = PreparedCheckedSetInduction
!PreparedSetInductionFocus
!(ScopedCheckedCore ObjectId)
![ScopedCheckedCore ObjectId]
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!PreparedProof
data PreparedProof
= PreparedImplicitAuto !PreparedDischarge
| PreparedQed !PreparedDischarge
| PreparedOmitted
!Location
!(ScopedCheckedCore ObjectId)
| PreparedFix ![Exact.ExactLocalId] !PreparedProof
| PreparedAssume
!(ScopedCheckedCore ObjectId)
!PreparedProof
| PreparedTake
![Exact.ExactLocalId]
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
!PreparedProof
| PreparedSetInduction !PreparedSetInduction
| PreparedHave
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
!PreparedProof
| PreparedSuffices
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
!PreparedProof
| PreparedCalculate
!PreparedCalculation
!PreparedProof
| PreparedSince
!(ScopedCheckedCore ObjectId)
!PreparedSinceEvidence
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
!PreparedProof
| PreparedSubclaim
!(ScopedCheckedCore ObjectId)
!PreparedProof
!PreparedProof
| PreparedDefine
!Exact.ExactLocalId
!(ScopedCheckedCore ObjectId)
!(NonEmpty (ScopedCheckedCore ObjectId))
!PreparedProof
| PreparedDefineRelational
!Exact.ExactLocalId
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
!(NonEmpty (ScopedCheckedCore ObjectId))
!PreparedProof
| PreparedDefineFunction
!Exact.ExactLocalId
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!PreparedProof
| PreparedByCase !PreparedCaseAnalysis
| PreparedByContradiction
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!PreparedProof
| PreparedContradiction
!(ScopedCheckedCore ObjectId)
!(ScopedCheckedCore ObjectId)
!PreparedDischarge
data PreparedExactProof = PreparedExactProof
!Location
!SemanticName
!(ScopedCheckedCore ObjectId)
!PreparedProof
!ProofSyntaxId
data PreparedFinalPreludeFoundationClaim =
PreparedFinalPreludeFoundationClaim
!Location
!SemanticName
!(ScopedCheckedCore ObjectId)
!FoundationAxiomTag
!ProofSyntaxId
preparedExactProofSyntaxId :: PreparedExactProof -> ProofSyntaxId
preparedExactProofSyntaxId
(PreparedExactProof _location _alias _target _proof syntax) =
syntax
preparedExactProofFirstOmission :: PreparedExactProof -> Maybe Location
preparedExactProofFirstOmission
(PreparedExactProof _location _alias _target proof _syntax) =
preparedProofFirstOmission proof
data PrepareState = PrepareState
{ prepareNextLocal :: !Natural
, prepareNextPremise :: !Natural
}
type Prepare =
StateT
PrepareState
(ExceptT ExactProofError (Declaration.LoweringDriver))
prepareExactProof
:: Raw.Block
-> Maybe Raw.Proof
-> Declaration.LoweringDriver
(Either ExactProofError PreparedExactProof)
prepareExactProof block explicitProof =
Except.runExceptT
(State.evalStateT prepare initialState)
where
initialState = PrepareState 0 0
prepare =
case block of
Raw.BlockClaim
_kind location _title (Raw.Marker marker)
(Raw.Claim assumptions statement) -> do
envelope <-
liftDriver
(Exact.prepareExactClaimEnvelope assumptions statement)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
let targetCore = Exact.preparedExactClaimTarget envelope
unless (null (scopedCoreContext targetCore))
(throwProof
(ExactProofUnsupportedClaim location))
(context, openedGoal, identities) <-
openEnvelopeVariables
targetCore
(Exact.preparedExactClaimVariables envelope)
(Exact.preparedExactClaimContext envelope)
(locals, bodyGoal, antecedents) <-
openEnvelopeAntecedents
context
openedGoal
(Exact.preparedExactClaimAntecedentCount envelope)
initialInduction <-
prepareInitialSetInductionView
statement
context
(Exact.preparedExactClaimVariables envelope)
identities
antecedents
bodyGoal
bodyProof <-
case explicitProof of
Nothing ->
PreparedImplicitAuto
<$> prepareDischarge
location
context
locals
bodyGoal
Raw.JustificationEmpty
Just sourceProof ->
prepareProof
location
context
locals
(InitialClaimInduction initialInduction)
bodyGoal
sourceProof
let withAssumptions =
foldr PreparedAssume bodyProof antecedents
proof =
case identities of
[] -> withAssumptions
_ -> PreparedFix identities withAssumptions
pure
(PreparedExactProof
location
(semanticName marker)
targetCore
proof
(proofSyntaxId
(encodePreparedProof proof)))
_ ->
throwProof
(ExactProofUnsupportedClaim (locate block))
prepareFinalPreludeFoundationClaim
:: CheckedFoundation
-> Raw.Block
-> Maybe Raw.Proof
-> Declaration.LoweringDriver
(Either ExactProofError PreparedFinalPreludeFoundationClaim)
prepareFinalPreludeFoundationClaim foundation block explicitProof =
Except.runExceptT do
case (block, explicitProof) of
( Raw.BlockClaim
_kind location _title (Raw.Marker marker)
(Raw.Claim assumptions statement)
, Nothing
) -> do
envelope <-
Except.lift
(Exact.prepareExactClaimEnvelope
assumptions
statement)
>>= either
(Except.throwError
. ExactProofElaborationFailed)
pure
unless
( null (Exact.preparedExactClaimVariables envelope)
&& Exact.preparedExactClaimAntecedentCount envelope
== 0
)
(Except.throwError
(ExactProofFoundationLeafRequiresImplicitAuto
location))
let target = Exact.preparedExactClaimTarget envelope
matches =
[ tag
| tag <- [minBound .. maxBound]
, target == foundationTarget tag
]
tag <- case matches of
[] ->
Except.throwError
(ExactProofFoundationLeafTargetMismatch location)
[only] ->
pure only
_ ->
Except.throwError
(ExactProofFoundationLeafTargetAmbiguous location)
pure
(PreparedFinalPreludeFoundationClaim
location
(semanticName marker)
target
tag
(implicitAutoProofSyntaxId target))
(Raw.BlockClaim _kind location _title _marker _claim, Just{}) ->
Except.throwError
(ExactProofFoundationLeafRequiresImplicitAuto location)
_ ->
Except.throwError
(ExactProofUnsupportedClaim (locate block))
where
foundationTarget tag =
embedClosedCore []
(mapFrozenGlobals
absurd
(foundationAxiomFrozen foundation tag))
openEnvelopeVariables
:: ScopedCheckedCore ObjectId
-> [Raw.VarSymbol]
-> Exact.ExactBinderContext
-> Prepare
( Exact.ExactBinderContext
, ScopedCheckedCore ObjectId
, [Exact.ExactLocalId]
)
openEnvelopeVariables target variables preparedContext =
case NonEmpty.nonEmpty variables of
Nothing ->
pure (preparedContext, target, [])
Just nonempty -> do
(_unannotated, opened, identities) <-
openFixedVariables
Exact.emptyExactBinderContext
target
nonempty
let expected =
reverse
(fst <$> toList
(Exact.exactBinderContextSupport preparedContext))
unless
(identities == expected)
(impossible
"prepared claim annotations do not match opened binders")
pure (preparedContext, opened, identities)
openEnvelopeAntecedents
:: Exact.ExactBinderContext
-> ScopedCheckedCore ObjectId
-> Natural
-> Prepare
( [PreparedLocal]
, ScopedCheckedCore ObjectId
, [ScopedCheckedCore ObjectId]
)
openEnvelopeAntecedents context initialGoal initialCount =
go [] [] initialGoal initialCount
where
go locals antecedents goal 0 =
pure (locals, goal, antecedents)
go locals antecedents goal remaining = do
(antecedent, conclusion) <-
maybe
(impossible
"a prepared claim envelope has too few implications")
pure
(openScopedImplication goal)
local <- allocateLocal ExactAssumption context antecedent
go
(locals <> [local])
(antecedents <> [antecedent])
conclusion
(remaining - 1)
prepareInitialSetInductionView
:: Raw.Stmt
-> Exact.ExactBinderContext
-> [Raw.VarSymbol]
-> [Exact.ExactLocalId]
-> [ScopedCheckedCore ObjectId]
-> ScopedCheckedCore ObjectId
-> Prepare InitialSetInductionView
prepareInitialSetInductionView
statement context variables identities antecedents bodyGoal = do
unless (length variables == length identities)
(impossible
"opened claim binders lost their source identity association")
foci <- traverse checkedFocus (zip variables identities)
let property = foldr implyChecked bodyGoal antecedents
support = Exact.exactBinderContextSupport context
unless
( scopedCoreContext property
== (snd <$> Vector.toList support)
)
(impossible
"initial set-induction property changed its checked context")
pure
(InitialSetInductionView
foci support property antecedents bodyGoal
(claimLeadingUniversalName statement))
where
checkedFocus (variable, identity) = do
index <-
maybe
(impossible
"an opened claim binder is absent from its exact context")
pure
(Exact.exactBinderContextIndex variable context)
case Exact.exactBinderContextSupport context
Vector.!? (fromIntegral index) of
Just (actualIdentity, TySet)
| actualIdentity == identity ->
pure
(InitialSetInductionFocus
variable identity index)
_ ->
impossible
"an initial set-induction focus changed identity or type"
implyChecked antecedent conclusion =
fromMaybe
(impossible
"an exact claim antecedent changed context")
(implyScopedCore antecedent conclusion)
claimLeadingUniversalName :: Raw.Stmt -> Maybe Raw.VarSymbol
claimLeadingUniversalName = \case
Raw.StmtFormula
(Raw.FormulaQuantified _location Raw.Universally
(variable :| _rest) _bound _formula) ->
Just variable
Raw.SymbolicForall _location (variable :| _rest)
_bound _suchThat _statement ->
Just variable
Raw.StmtQuantPhrase
_location
(Raw.QuantPhrase Raw.Universally
(Raw.NounPhrase _left _noun variables _right _suchThat))
_statement ->
listToMaybe variables
Raw.StmtVerbPhrase
(Raw.TermQuantified Raw.Universally _location
(Raw.NounPhrase _left _noun variable _right _suchThat)
:| [])
_verb ->
variable
Raw.StmtNoun
(Raw.TermQuantified Raw.Universally _location
(Raw.NounPhrase _left _noun variable _right _suchThat)
:| [])
_nounPhrase ->
variable
_statement ->
Nothing
prepareProof
:: Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> SetInductionBoundary
-> ScopedCheckedCore ObjectId
-> Raw.Proof
-> Prepare PreparedProof
prepareProof fallback context locals inductionBoundary goal = \case
Raw.Omitted location ->
pure (PreparedOmitted location goal)
Raw.Qed maybeLocation justification ->
PreparedQed
<$> prepareDischarge
(fromMaybe fallback maybeLocation)
context
locals
goal
justification
Raw.FixSymbolic location variables bound continuation -> do
(context', goal', identities) <-
openFixedVariables context goal variables
case bound of
Raw.Unbounded ->
PreparedFix identities
<$> prepareProof
fallback
context'
locals
RecursiveProofInduction
goal'
continuation
_ -> do
constraint <-
prepareSymbolicBoundConstraints
context' variables bound
prepareGuardedFix
fallback location context' locals goal'
identities constraint continuation
Raw.FixSuchThat location variables statement continuation -> do
(context', goal', identities) <-
openFixedVariables context goal variables
constraint <-
Exact.preparedExactPropositionCore
<$> prepareStatement context' statement
prepareGuardedFix
fallback location context' locals goal'
identities constraint continuation
Raw.Assume location statement continuation -> do
supplied <- prepareStatement context statement
when (isNothing (openScopedImplication goal))
(throwProof (ExactProofExpectedImplicationGoal location))
(assumption, conclusion) <-
maybe
(throwProof (ExactProofGoalStatementMismatch location))
pure
(openScopedAssumption
(Exact.preparedExactPropositionCore supplied)
goal)
local <- allocateLocal ExactAssumption context assumption
PreparedAssume assumption
<$> prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
conclusion
continuation
Raw.TakeVar location variables bound statement justification continuation -> do
prepareSymbolicTake
fallback location context locals goal variables bound statement
justification continuation
Raw.TakeNoun location nounPhrase justification continuation ->
prepareNounTake
fallback location context locals goal nounPhrase
justification continuation
Raw.BySetInduction location variable continuation ->
prepareSetInduction
fallback location context locals inductionBoundary goal
variable continuation
Raw.Have location Nothing
(Raw.SymbolicExists _existential variables bound statement)
justification continuation ->
prepareSymbolicTake
fallback location context locals goal variables bound statement
justification continuation
Raw.Have location Nothing statement justification continuation -> do
claim <-
Exact.preparedExactPropositionCore
<$> prepareStatement context statement
discharge <-
prepareDischarge
location context locals claim justification
local <- allocateLocal ExactDerivedClaim context claim
PreparedHave claim discharge
<$> prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
goal
continuation
Raw.Have location (Just sinceStatement)
statement justification continuation -> do
sinceProposition <-
Exact.preparedExactPropositionCore
<$> prepareStatement context sinceStatement
claim <-
Exact.preparedExactPropositionCore
<$> prepareStatement context statement
(evidence, sinceLocals) <-
case find (localMatches sinceProposition) locals of
Just existing ->
pure (PreparedSinceExisting existing, locals)
Nothing -> do
discharge <-
prepareDischarge
location
context
locals
sinceProposition
Raw.JustificationLocal
local <-
allocateLocal
ExactDerivedClaim context sinceProposition
pure
( PreparedSinceDischarged discharge local
, locals <> [local]
)
claimDischarge <-
prepareDischarge
location context sinceLocals claim justification
claimLocal <-
allocateLocal ExactDerivedClaim context claim
PreparedSince
sinceProposition evidence claim claimDischarge
<$> prepareProof
fallback
context
(sinceLocals <> [claimLocal])
RecursiveProofInduction
goal
continuation
Raw.Suffices location statement justification continuation -> do
reduction <-
Exact.preparedExactPropositionCore
<$> prepareStatement context statement
implication <-
maybe
(impossible
"a checked suffices reduction changed lexical context")
pure
(implyScopedCore reduction goal)
discharge <-
prepareDischarge
location context locals implication justification
PreparedSuffices goal reduction implication discharge
<$> prepareProof
fallback
context
locals
(SourceStatementInduction
(claimLeadingUniversalName statement))
reduction
continuation
Raw.Calc location quantifier calculation continuation -> do
prepared <-
prepareCalculation
location context locals quantifier calculation
local <-
allocateLocal
ExactDerivedClaim
context
(preparedCalculationResult prepared)
PreparedCalculate prepared
<$> prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
goal
continuation
Raw.Subclaim location statement subproof continuation -> do
claim <-
Exact.preparedExactPropositionCore
<$> prepareStatement context statement
preparedSubproof <-
prepareProof
location
context
locals
(SourceStatementInduction
(claimLeadingUniversalName statement))
claim
subproof
local <- allocateLocal ExactDerivedClaim context claim
PreparedSubclaim claim preparedSubproof
<$> prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
goal
continuation
Raw.Define location variable expression continuation -> do
preparedBody <-
liftDriver
(Exact.prepareExactSetExpression context expression)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
let body = Exact.preparedExactSetExpressionCore preparedBody
identity <- allocateLocalIdentity
context' <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
((identity, variable) :| [])
context)
case Exact.preparedExactSetExpressionConstruction preparedBody of
Nothing -> do
separationCharacteristic <-
liftDriver
(Declaration.currentFoundationAxiomLowering
SeparationCharacteristic)
definition <-
maybe
(impossible
"an exact set expression did not form a local definition")
pure
(scopedSetDefinition separationCharacteristic body)
local <-
allocateLocal ExactLocalDefinition context' definition
PreparedDefine identity body (definition :| [])
<$> prepareProof
fallback context' (locals <> [local])
RecursiveProofInduction
(weakenCheckedScopedCore TySet goal)
continuation
Just (Exact.PreparedUnconditionalSetConstruction construction) -> do
characteristics <- prepareConstructionFoundation
(extensional, equation) <-
maybe
(impossible
"a checked named construction has no definition views")
pure
(namedSetConstructionLocalViews
characteristics construction)
extensionalLocal <-
allocateLocal
ExactLocalConstructionExtensional context' extensional
equationLocal <-
allocateLocal
ExactLocalConstructionEquation context' equation
PreparedDefine identity body (extensional :| [equation])
<$> prepareProof
fallback context'
(locals <> [extensionalLocal, equationLocal])
RecursiveProofInduction
(weakenCheckedScopedCore TySet goal)
continuation
Just (Exact.PreparedRelationalSetConstruction construction) -> do
characteristics <- prepareConstructionFoundation
let functionality =
relationalSetConstructionFunctionality construction
discharge <-
prepareDischarge
location context locals functionality
Raw.JustificationEmpty
(extensional, equation) <-
maybe
(impossible
"a checked relational construction has no admitted definition views")
pure
(relationalSetConstructionLocalViews
characteristics construction functionality)
extensionalLocal <-
allocateLocal
ExactLocalConstructionExtensional context' extensional
equationLocal <-
allocateLocal
ExactLocalConstructionEquation context' equation
PreparedDefineRelational
identity body discharge (extensional :| [equation])
<$> prepareProof
fallback context'
(locals <> [extensionalLocal, equationLocal])
RecursiveProofInduction
(weakenCheckedScopedCore TySet goal)
continuation
Raw.DefineFunction
location function argument value bound domain continuation -> do
unless (argument == bound)
(throwProof
(ExactProofLocalFunctionBinderMismatch (locate bound)))
when (function == argument)
(throwProof
(ExactProofLocalFunctionNameConflict (locate function)))
argumentIdentity <- allocateLocalIdentity
argumentContext <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
((argumentIdentity, argument) :| [])
context)
graph <-
liftDriver
(Exact.prepareExactLocalFunctionGraph
location context argumentContext domain value)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
functionIdentity <- allocateLocalIdentity
functionContext <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
((functionIdentity, function) :| [])
context)
replacementCharacteristic <-
liftDriver
(Declaration.currentFoundationAxiomLowering
ReplacementCharacteristic)
definition <-
maybe
(impossible
"a checked replacement graph did not form a local definition")
pure
(scopedCharacteristicDefinition
replacementCharacteristic
(Exact.preparedExactLocalFunctionGraphCore graph)
( Exact.preparedExactLocalFunctionGraphDomain graph
:| [Exact.preparedExactLocalFunctionGraphMap graph]
))
local <-
allocateLocal ExactLocalDefinition functionContext definition
PreparedDefineFunction
functionIdentity
(Exact.preparedExactLocalFunctionGraphCore graph)
definition
<$> prepareProof
fallback
functionContext
(locals <> [local])
RecursiveProofInduction
(weakenCheckedScopedCore TySet goal)
continuation
Raw.ByCase location sourceCases ->
prepareByCase
location context locals goal sourceCases
Raw.ByContradiction location continuation -> do
let falsum = falsumScopedCore (scopedCoreContext goal)
negation <-
maybe
(structuralFailure
location
"proof by contradiction requires a proposition goal")
pure
(negateScopedCore goal)
local <- allocateLocal ExactAssumption context negation
prepared <-
prepareProof
location
context
(locals <> [local])
RecursiveProofInduction
falsum
continuation
validateStructuralComposition
location [goal, negation, falsum]
(\foundation globalType ->
KernelProof.validateDoubleNegationComposition
foundation globalType goal negation falsum)
pure
(PreparedByContradiction
goal negation falsum prepared)
Raw.Contradiction location justification -> do
let falsum = falsumScopedCore (scopedCoreContext goal)
discharge <-
prepareDischarge
location
context
locals
falsum
justification
validateStructuralComposition
location [goal, falsum]
(\foundation globalType ->
KernelProof.validateFalsumEliminationComposition
foundation globalType goal falsum)
pure (PreparedContradiction goal falsum discharge)
proof ->
throwProof
(ExactProofUnsupportedStep
(proofLocation fallback proof))
where
localMatches proposition
(PreparedLocal _ordinal _origin _support local) =
local == proposition
prepareSetInduction
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> SetInductionBoundary
-> ScopedCheckedCore ObjectId
-> Maybe Raw.Term
-> Raw.Proof
-> Prepare PreparedProof
prepareSetInduction
fallback location context locals boundary goal sourceFocus
continuation = do
selected <-
selectSetInductionFocus
location context boundary goal sourceFocus
case selected of
SelectedInitialSetInduction
(InitialSetInductionFocus _variable identity index) -> do
(foci, expectedSupport, property, antecedents, childTarget) <-
case boundary of
InitialClaimInduction
(InitialSetInductionView
foundFoci support foundProperty
foundAntecedents foundTarget _leadingName) ->
pure
( foundFoci
, support
, foundProperty
, foundAntecedents
, foundTarget
)
RecursiveProofInduction ->
impossible
"an initial induction focus escaped its claim boundary"
SourceStatementInduction _leadingName ->
impossible
"an initial induction focus escaped its claim boundary"
unless
( Exact.exactBinderContextSupport context == expectedSupport
&& goal == childTarget
&& any (sameInitialFocus identity index) foci
)
(throwProof
(ExactProofSetInductionGoalMismatch location))
PreparedSetInduction
<$> prepareCheckedSetInduction
fallback location context locals
(PreparedInitialSetInductionFocus identity index)
index property antecedents childTarget continuation
SelectedLeadingSetInduction sourceName -> do
(binderType, property) <-
maybe
(throwProof
(ExactProofSetInductionGoalMismatch location))
pure
(openScopedForall goal)
unless (binderType == TySet)
(throwProof
(ExactProofSetInductionGoalMismatch location))
identity <- allocateLocalIdentity
extendedContext <-
either
(throwProof . ExactProofElaborationFailed)
pure
(case sourceName of
Just variable ->
Exact.extendExactBinderContext
((identity, variable) :| [])
context
Nothing ->
Exact.extendExactAnonymousBinderContext
identity context)
let expectedResult = weakenCheckedScopedCore TySet goal
prepared <- prepareCheckedSetInduction
fallback location extendedContext locals
(PreparedLeadingSetInductionFocus identity)
0 property [] property continuation
unless
(preparedSetInductionResult prepared == expectedResult)
(throwProof
(ExactProofSetInductionGoalMismatch location))
pure (PreparedSetInduction prepared)
where
sameInitialFocus expectedIdentity expectedIndex
(InitialSetInductionFocus _variable identity index) =
identity == expectedIdentity && index == expectedIndex
prepareCheckedSetInduction
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> PreparedSetInductionFocus
-> Natural
-> ScopedCheckedCore ObjectId
-> [ScopedCheckedCore ObjectId]
-> ScopedCheckedCore ObjectId
-> Raw.Proof
-> Prepare PreparedSetInduction
prepareCheckedSetInduction
fallback location context locals focus selected property antecedents
childTarget continuation = do
(_predicate, hypothesis, _step, result) <-
maybe
(throwProof
(ExactProofSetInductionGoalMismatch location))
pure
(scopedSetInductionInstance selected property)
validateStructuralComposition
location
(property : hypothesis : result : childTarget : antecedents)
(\foundation globalType ->
KernelProof.validateSetInductionComposition
foundation globalType selected property antecedents
childTarget hypothesis result)
local <- allocateLocal ExactAssumption context hypothesis
child <-
prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
childTarget
continuation
pure
(PreparedCheckedSetInduction
focus property antecedents childTarget hypothesis result child)
preparedSetInductionResult
:: PreparedSetInduction
-> ScopedCheckedCore ObjectId
preparedSetInductionResult
(PreparedCheckedSetInduction
_focus _property _antecedents _target _hypothesis result _child) =
result
selectSetInductionFocus
:: Location
-> Exact.ExactBinderContext
-> SetInductionBoundary
-> ScopedCheckedCore ObjectId
-> Maybe Raw.Term
-> Prepare SelectedSetInductionFocus
selectSetInductionFocus location context boundary goal sourceFocus = do
explicit <- traverse simpleVariable sourceFocus
let (initialFoci, retainedLeadingName) =
case boundary of
InitialClaimInduction
(InitialSetInductionView
foci _support _property _antecedents _target
leadingName) ->
(foci, leadingName)
SourceStatementInduction leadingName ->
([], leadingName)
RecursiveProofInduction ->
([], Nothing)
leadingAvailable =
case openScopedForall goal of
Just (TySet, _body) -> True
_ -> False
case explicit of
Just variable ->
case find (initialNamed variable) initialFoci of
Just focus ->
pure (SelectedInitialSetInduction focus)
Nothing
| leadingAvailable
, isJust
(Exact.exactBinderContextIndex variable context) ->
throwProof
(ExactProofSetInductionBinderConflict
location variable)
| leadingAvailable ->
pure
(SelectedLeadingSetInduction
(Just variable))
| isJust
(Exact.exactBinderContextIndex variable context) ->
throwProof
(ExactProofSetInductionActiveBinderIneligible
location variable)
| otherwise ->
throwProof
(ExactProofSetInductionVariableNotActive
location variable)
Nothing ->
case
( (SelectedInitialSetInduction <$> initialFoci)
<> [ SelectedLeadingSetInduction retainedLeadingName
| leadingAvailable
]
) of
[only] -> pure only
_ ->
throwProof
(ExactProofSetInductionFocusAmbiguous location)
where
simpleVariable = \case
Raw.TermExpr (Raw.ExprVar variable) ->
pure variable
_term ->
throwProof
(ExactProofSetInductionVariableRequired location)
initialNamed variable
(InitialSetInductionFocus candidate _identity _index) =
candidate == variable
prepareByCase
:: Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> [Raw.Case]
-> Prepare PreparedProof
prepareByCase location context locals goal sourceCases = do
cases <-
maybe
(throwProof (ExactProofEmptyCaseSplit location))
(traverse prepareCase)
(NonEmpty.nonEmpty sourceCases)
exhaustive <-
foldM disjoin
(preparedCaseAssumption (NonEmpty.head cases))
(preparedCaseAssumption <$> NonEmpty.tail cases)
discharge <-
prepareDischarge
location context locals exhaustive Raw.JustificationEmpty
validateStructuralComposition
location
(goal : exhaustive : (preparedCaseAssumption <$> toList cases))
(\foundation globalType ->
KernelProof.validateCaseAnalysisComposition
foundation
globalType
goal
(preparedCaseAssumption <$> cases)
exhaustive)
pure
(PreparedByCase
(PreparedCaseAnalysis goal cases exhaustive discharge))
where
prepareCase (Raw.Case statement child) = do
assumption <-
Exact.preparedExactPropositionCore
<$> prepareStatement context statement
local <- allocateLocal ExactAssumption context assumption
prepared <-
prepareProof
(locate statement)
context
(locals <> [local])
RecursiveProofInduction
goal
child
pure (PreparedCase assumption prepared)
disjoin left right =
maybe
(structuralFailure
location
"case assumptions changed type or lexical context")
pure
(disjoinScopedCore left right)
preparedCaseAssumption
:: PreparedCase
-> ScopedCheckedCore ObjectId
preparedCaseAssumption (PreparedCase assumption _proof) =
assumption
preparedCaseProof :: PreparedCase -> PreparedProof
preparedCaseProof (PreparedCase _assumption proof) =
proof
prepareGuardedFix
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> [Exact.ExactLocalId]
-> ScopedCheckedCore ObjectId
-> Raw.Proof
-> Prepare PreparedProof
prepareGuardedFix
fallback location context locals goal identities constraint continuation = do
(antecedent, conclusion) <-
maybe
(throwProof (ExactProofExpectedImplicationGoal location))
pure
(openScopedImplication goal)
unless (constraint == antecedent)
(throwProof (ExactProofGoalStatementMismatch location))
local <- allocateLocal ExactAssumption context constraint
prepared <-
prepareProof
fallback
context
(locals <> [local])
RecursiveProofInduction
conclusion
continuation
pure (PreparedFix identities (PreparedAssume constraint prepared))
prepareCalculation
:: Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> Maybe Raw.CalcQuantifier
-> Raw.Calc
-> Prepare PreparedCalculation
prepareCalculation location context locals quantifier calculation = do
(identities, calculationContext, calculationGuard) <-
prepareCalculationScope context quantifier
case calculation of
Raw.Equation first destinations -> do
firstChecked <- prepareSetEndpoint calculationContext first
checkedDestinations <-
traverse
(\(destination, justification) -> do
checked <-
prepareSetEndpoint calculationContext destination
pure
( locate destination
, checked
, justification
))
destinations
finishCalculation
location context locals TySet identities calculationGuard
firstChecked checkedDestinations
Raw.Biconditionals first destinations -> do
firstChecked <- preparePropositionEndpoint calculationContext first
checkedDestinations <-
traverse
(\(destination, justification) -> do
checked <-
preparePropositionEndpoint
calculationContext destination
pure
( locate destination
, checked
, justification
))
destinations
finishCalculation
location context locals TyProp identities calculationGuard
firstChecked checkedDestinations
where
prepareSetEndpoint endpointContext expression =
Exact.preparedExactSetExpressionCore
<$> ( liftDriver
(Exact.prepareExactSetExpression
endpointContext expression)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
)
preparePropositionEndpoint endpointContext formula =
Exact.preparedExactPropositionCore
<$> prepareStatement endpointContext (Raw.StmtFormula formula)
prepareCalculationScope
:: Exact.ExactBinderContext
-> Maybe Raw.CalcQuantifier
-> Prepare
( [Exact.ExactLocalId]
, Exact.ExactBinderContext
, Maybe (ScopedCheckedCore ObjectId)
)
prepareCalculationScope context = \case
Nothing ->
pure ([], context, Nothing)
Just (Raw.CalcQuantifier variables bound suchThat) -> do
identities <- traverse (const allocateLocalIdentity) variables
calculationContext <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
(NonEmpty.zip identities variables)
context)
boundGuard <-
prepareSymbolicBoundConstraints
calculationContext variables bound
suchThatGuard <-
traverse
(fmap Exact.preparedExactPropositionCore
. prepareStatement calculationContext)
suchThat
calculationGuard <-
normalizeCalculationGuard
(boundGuard : maybeToList suchThatGuard)
pure (toList identities, calculationContext, calculationGuard)
normalizeCalculationGuard
:: [ScopedCheckedCore ObjectId]
-> Prepare (Maybe (ScopedCheckedCore ObjectId))
normalizeCalculationGuard guards =
foldM add Nothing guards
where
add accumulated constraint
| isScopedTruth constraint = pure accumulated
| otherwise =
case accumulated of
Nothing -> pure (Just constraint)
Just previous ->
Just
<$> maybe
(impossible
"checked calculation guards changed context")
pure
(conjoinScopedCore previous constraint)
isScopedTruth proposition =
scopedCoreType proposition == TyProp
&& scopedCoreTerm proposition == CImp CFalsum CFalsum
finishCalculation
:: Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> CoreType
-> [Exact.ExactLocalId]
-> Maybe (ScopedCheckedCore ObjectId)
-> ScopedCheckedCore ObjectId
-> NonEmpty
( Location
, ScopedCheckedCore ObjectId
, Raw.Justification
)
-> Prepare PreparedCalculation
finishCalculation
fallback context locals operandType identities calculationGuard
first destinations = do
links <- prepareCalculationLinks first destinations
let finalEndpoint = preparedCalculationLinkDestination (NonEmpty.last links)
resultOpen <-
calculationEquality first finalEndpoint
result <-
closeCalculationProposition identities calculationGuard resultOpen
pure
(PreparedCheckedCalculation
operandType identities calculationGuard first links result)
where
prepareCalculationLinks previous (destination :| rest) = do
(next, firstLink) <- prepareCalculationLink previous destination
later <- prepareRemainingCalculationLinks next rest
pure (firstLink :| later)
prepareRemainingCalculationLinks _previous [] =
pure []
prepareRemainingCalculationLinks previous (destination : rest) = do
(next, link) <- prepareCalculationLink previous destination
(link :) <$> prepareRemainingCalculationLinks next rest
prepareCalculationLink previous
(destinationLocation, destination, justification) = do
linkOpen <- calculationEquality previous destination
link <- closeCalculationProposition
identities calculationGuard linkOpen
discharge <-
prepareDischarge
(if destinationLocation == Nowhere
then fallback
else destinationLocation)
context
locals
link
justification
pure
( destination
, PreparedCalculationLink destination discharge
)
calculationEquality left right =
maybe
(impossible
"checked calculation endpoints changed type or context")
pure
(equalScopedCore left right)
closeCalculationProposition
:: [Exact.ExactLocalId]
-> Maybe (ScopedCheckedCore ObjectId)
-> ScopedCheckedCore ObjectId
-> Prepare (ScopedCheckedCore ObjectId)
closeCalculationProposition identities calculationGuard proposition = do
guarded <-
case calculationGuard of
Nothing -> pure proposition
Just constraint ->
maybe
(impossible
"a checked calculation guard changed context")
pure
(implyScopedCore constraint proposition)
pure (closeBinders (length identities) guarded)
where
closeBinders 0 closed = closed
closeBinders remaining open =
closeBinders (remaining - 1)
(fromMaybe
(impossible
"a checked calculation lost a quantified binder")
(closeScopedForall open))
preparedCalculationResult
:: PreparedCalculation
-> ScopedCheckedCore ObjectId
preparedCalculationResult
(PreparedCheckedCalculation
_operandType _identities _guard _first _links result) =
result
preparedCalculationLinkDestination
:: PreparedCalculationLink
-> ScopedCheckedCore ObjectId
preparedCalculationLinkDestination
(PreparedCalculationLink destination _discharge) =
destination
preparedCalculationLinkDischarge
:: PreparedCalculationLink
-> PreparedDischarge
preparedCalculationLinkDischarge
(PreparedCalculationLink _destination discharge) =
discharge
preparedDischargeGoal
:: PreparedDischarge
-> ScopedCheckedCore ObjectId
preparedDischargeGoal = \case
PreparedVampireDischarge _location _justification goal _obligation ->
goal
PreparedSetExtensionality _location goal ->
goal
prepareSymbolicBoundConstraints
:: Exact.ExactBinderContext
-> NonEmpty Raw.VarSymbol
-> Raw.Bound
-> Prepare (ScopedCheckedCore ObjectId)
prepareSymbolicBoundConstraints context variables bound =
Exact.preparedExactPropositionCore
<$> ( liftDriver
(Exact.prepareExactSymbolicBoundConstraints
context variables bound)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
)
prepareSymbolicTake
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> NonEmpty Raw.VarSymbol
-> Raw.Bound
-> Raw.Stmt
-> Raw.Justification
-> Raw.Proof
-> Prepare PreparedProof
prepareSymbolicTake
fallback location context locals goal variables bound statement
justification continuation = do
identities <- traverse (const allocateLocalIdentity) variables
context' <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
(NonEmpty.zip identities variables)
context)
witness <-
Exact.preparedExactPropositionCore
<$> ( liftDriver
(Exact.prepareExactSymbolicWitnessConstraints
context' variables bound statement)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
)
prepareTake
fallback location context locals goal context'
(toList identities) witness justification continuation
prepareNounTake
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> Raw.NounPhrase []
-> Raw.Justification
-> Raw.Proof
-> Prepare PreparedProof
prepareNounTake
fallback location context locals goal nounPhrase
justification continuation = do
(identities, context') <-
case nounPhrase of
Raw.NounPhrase _left _noun variables _right _suchThat ->
case NonEmpty.nonEmpty variables of
Just binders -> do
identities <-
traverse (const allocateLocalIdentity) binders
context' <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
(NonEmpty.zip identities binders)
context)
pure (toList identities, context')
Nothing -> do
identity <- allocateLocalIdentity
context' <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactAnonymousBinderContext
identity context)
pure ([identity], context')
witness <-
Exact.preparedExactPropositionCore
<$> ( liftDriver
(Exact.prepareExactNounWitnessConstraints
context' nounPhrase)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
)
prepareTake
fallback location context locals goal context'
identities witness justification continuation
prepareTake
:: Location
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> Exact.ExactBinderContext
-> [Exact.ExactLocalId]
-> ScopedCheckedCore ObjectId
-> Raw.Justification
-> Raw.Proof
-> Prepare PreparedProof
prepareTake
fallback location context locals goal witnessContext
identities witness justification continuation = do
let witnessCount = length identities
existence = closeTakenWitnesses witnessCount witness
goal' = weakenForTakenWitnesses witnessCount goal
discharge <-
prepareDischarge
location context locals existence justification
local <- allocateLocal ExactAssumption witnessContext witness
PreparedTake identities witness discharge
<$> prepareProof
fallback
witnessContext
(locals <> [local])
RecursiveProofInduction
goal'
continuation
-- The discharged existential and the opened witness premise are the same
-- checked proposition viewed on opposite sides of existential elimination.
closeTakenWitnesses
:: Int
-> ScopedCheckedCore ObjectId
-> ScopedCheckedCore ObjectId
closeTakenWitnesses binderCount = go binderCount
where
go 0 proposition = proposition
go remaining proposition =
go (remaining - 1)
(fromMaybe
(impossible "a taken witness has no checked binder")
(closeScopedExists proposition))
weakenForTakenWitnesses
:: Int
-> ScopedCheckedCore ObjectId
-> ScopedCheckedCore ObjectId
weakenForTakenWitnesses binderCount = go binderCount
where
go 0 proposition = proposition
go remaining proposition =
go (remaining - 1)
(weakenCheckedScopedCore TySet proposition)
openFixedVariables
:: Exact.ExactBinderContext
-> ScopedCheckedCore ObjectId
-> NonEmpty Raw.VarSymbol
-> Prepare
( Exact.ExactBinderContext
, ScopedCheckedCore ObjectId
, [Exact.ExactLocalId]
)
openFixedVariables initialContext initialGoal variables =
foldM openOne
(initialContext, initialGoal, [])
(toList variables)
where
openOne (context, goal, identities) variable = do
(binderType, body) <-
maybe
(throwProof
(ExactProofExpectedUniversalGoal
(locate variable)))
pure
(openScopedForall goal)
unless (binderType == TySet)
(throwProof
(ExactProofExpectedUniversalGoal
(locate variable)))
identity <- allocateLocalIdentity
context' <-
either
(throwProof . ExactProofElaborationFailed)
pure
(Exact.extendExactBinderContext
((identity, variable) :| [])
context)
pure (context', body, identities <> [identity])
allocateLocalIdentity :: Prepare Exact.ExactLocalId
allocateLocalIdentity = do
state <- State.get
State.put
state
{ prepareNextLocal = prepareNextLocal state + 1
}
pure (Exact.exactLocalId (prepareNextLocal state))
allocateLocal
:: ExactLocalOrigin
-> Exact.ExactBinderContext
-> ScopedCheckedCore ObjectId
-> Prepare PreparedLocal
allocateLocal origin context proposition = do
state <- State.get
State.put
state
{ prepareNextPremise = prepareNextPremise state + 1
}
pure
(PreparedLocal
(Backend.localPremiseOrdinal
(prepareNextPremise state))
origin
(Exact.exactBinderContextSupport context)
proposition)
prepareConstructionFoundation
:: Prepare SetConstructionFoundation
prepareConstructionFoundation = do
familyUnion <- foundation FamilyUnionCharacteristic
separation <- foundation SeparationCharacteristic
replacement <- foundation ReplacementCharacteristic
setChoose <- foundation SetChooseWitness
pure
(setConstructionFoundation
familyUnion separation replacement setChoose)
where
foundation tag =
liftDriver
(Declaration.currentFoundationAxiomLowering tag)
prepareDischarge
:: Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> Raw.Justification
-> Prepare PreparedDischarge
prepareDischarge location context locals goal justification =
prepareDischargeWith
(dischargeModeFor goal)
[] Nothing location context locals goal justification
-- A contradictory-axioms answer can establish falsum, but never an unrelated
-- proposition directly. Derive that distinction from the checked target so
-- every surface proof spelling reaches the same guarded request path.
dischargeModeFor :: ScopedCheckedCore ObjectId -> DischargeMode
dischargeModeFor goal
| scopedCoreType goal == TyProp
, scopedCoreTerm goal == CFalsum =
IndirectContradictionDischarge
| otherwise =
DirectDischarge
data DischargeMode
= DirectDischarge
| IndirectContradictionDischarge
prepareDischargeWith
:: DischargeMode
-> [FoundationAxiomTag]
-> Maybe Declaration.VampirePremiseSelection
-> Location
-> Exact.ExactBinderContext
-> [PreparedLocal]
-> ScopedCheckedCore ObjectId
-> Raw.Justification
-> Prepare PreparedDischarge
prepareDischargeWith
dischargeMode auxiliaries selectionOverride
location context locals goal justification =
case justification of
Raw.JustificationSetExt -> do
(leftToRight, rightToLeft) <-
maybe
(throwProof
(ExactProofSetExtensionalityGoalMismatch location))
pure
(splitScopedSetEquality goal)
unless
( hasDerivedLocal leftToRight
&& hasDerivedLocal rightToLeft
)
(throwProof
(ExactProofSetExtensionalityDirectionsUnavailable
location))
pure (PreparedSetExtensionality location goal)
_ -> do
preparedJustification <-
prepareJustification location justification
prepared <-
liftDriver
(prepareObligation
(Exact.exactBinderContextSupport context)
goal
(toScopedPremise <$> locals)
auxiliaries
(fromMaybe
(vampirePremiseSelection preparedJustification)
selectionOverride))
>>= either
(throwProof
. ExactProofObligationPreparationFailed location)
pure
pure
(PreparedVampireDischarge
location
preparedJustification
goal
prepared)
where
prepareObligation =
case dischargeMode of
DirectDischarge ->
Declaration.prepareScopedVampireObligationLowering
IndirectContradictionDischarge ->
Declaration.prepareScopedContradictionObligationLowering
hasDerivedLocal proposition =
any
(\case
PreparedLocal
_ordinal ExactDerivedClaim _support local ->
local == proposition
PreparedLocal{} ->
False)
locals
toScopedPremise
(PreparedLocal ordinal origin support proposition) =
Declaration.scopedVampirePremise
ordinal origin support proposition
prepareJustification
:: Location
-> Raw.Justification
-> Prepare PreparedJustification
prepareJustification _location Raw.JustificationEmpty =
pure PreparedAuto
prepareJustification location (Raw.JustificationRef markers) = do
resolved <- traverse (resolveReference location) (toList markers)
let unique = stableUnique resolved
case unique of
[] ->
impossible "a nonempty citation list resolved to no facts"
first : rest ->
pure (PreparedReferences (first :| rest))
prepareJustification _location Raw.JustificationLocal =
pure PreparedLocalOnly
prepareJustification location Raw.JustificationSetExt =
throwProof (ExactProofUnsupportedStep location)
vampirePremiseSelection
:: PreparedJustification
-> Declaration.VampirePremiseSelection
vampirePremiseSelection = \case
PreparedAuto ->
Declaration.VampireImplicitPremises
PreparedReferences fingerprints ->
Declaration.VampireExplicitPremises fingerprints
PreparedLocalOnly ->
Declaration.VampireLocalPremises
resolveReference
:: Location
-> Raw.Marker
-> Prepare SemanticFactOccurrenceFingerprint
resolveReference location marker@(Raw.Marker name) = do
resolved <-
liftDriver
(Declaration.resolveVisibleFactAliasLowering
(semanticName name))
maybe
(throwProof
(ExactProofUnknownReference location marker))
pure
resolved
prepareStatement
:: Exact.ExactBinderContext
-> Raw.Stmt
-> Prepare Exact.PreparedExactProposition
prepareStatement context statement =
liftDriver
(Exact.prepareExactProposition context statement)
>>= either
(throwProof . ExactProofElaborationFailed)
pure
validateStructuralComposition
:: Location
-> [ScopedCheckedCore ObjectId]
-> ( CheckedFoundation
-> (ObjectId -> Maybe CoreType)
-> Either KernelProof.KernelProofBuildError ()
)
-> Prepare ()
validateStructuralComposition location propositions validate = do
foundation <-
liftDriver Declaration.currentFoundationLowering
let identities =
Set.toAscList
(Set.unions
( canonicalTermGlobals . scopedCoreTerm
<$> propositions
))
types <-
traverse
(\identity -> do
coreType <-
liftDriver
(Declaration.objectTypeLowering identity)
maybe
(impossible
"a checked structural proof lost a global object")
(\availableType -> pure (identity, availableType))
coreType)
identities
either
(throwProof
. ExactProofStructuralCompositionFailed location)
pure
(validate foundation
(\identity -> Map.lookup identity (Map.fromList types)))
structuralFailure :: Location -> Text -> Prepare value
structuralFailure location message =
throwProof
(ExactProofStructuralCompositionFailed
location
(KernelProof.ProofStructuralCompositionMismatch message))
data CheckedExactProofAuthorization = CheckedExactProofAuthorization
!PreparedProof
!Bool
lowerPreparedExactProof
:: PreparedExactProof
-> Declaration.LoweringDriver
(Either
Declaration.DeclarationError
(Declaration.CheckedDeclaration CheckedExactProofAuthorization))
lowerPreparedExactProof
(PreparedExactProof _location alias target proof syntax) =
fmap checked
<$> Declaration.prepareCandidateSpecLowering
[] target SearchEligible [alias]
where
checked spec =
Declaration.checkedProofDeclaration
syntax [] [] [] []
[Declaration.checkedCandidate spec planning :| []]
(CheckedExactProofAuthorization
proof
(isJust (preparedProofFirstOmission proof)))
where
requests = plannedProofRequests proof
planning
| isJust (preparedProofFirstOmission proof) =
Declaration.checkedOmittedPlanning requests []
| otherwise =
Declaration.checkedSourceProofPlanning requests []
authorizeCheckedExactProof
:: CheckedExactProofAuthorization
-> [NonEmpty Declaration.ReservedCandidate]
-> Declaration.Declaration ()
authorizeCheckedExactProof
(CheckedExactProofAuthorization proof hasOmission) = \case
[candidate :| []]
| hasOmission ->
Declaration.authorizeOmittedCandidate
candidate
(executePreparedProof proof)
| otherwise ->
Declaration.authorizeVampireCandidate
candidate
(executePreparedProof proof)
stages ->
Declaration.failDeclaration
(Declaration.CheckedAuthorizationCandidateShapeMismatch
1 (length stages))
data CheckedFinalPreludeFoundationAuthorization =
CheckedFinalPreludeFoundationAuthorization !FoundationAxiomTag
lowerPreparedFinalPreludeFoundationClaim
:: PreparedFinalPreludeFoundationClaim
-> Declaration.LoweringDriver
(Either
Declaration.DeclarationError
(Declaration.CheckedDeclaration
CheckedFinalPreludeFoundationAuthorization))
lowerPreparedFinalPreludeFoundationClaim
(PreparedFinalPreludeFoundationClaim
_location alias target tag syntax) =
fmap checked
<$> Declaration.prepareCandidateSpecLowering
[] target SearchEligible [alias]
where
checked spec =
Declaration.checkedProofDeclaration
syntax [] [] [] []
[ Declaration.checkedCandidate spec
(Declaration.checkedKernelPlanning
(Authority.FoundationLeaf tag) [])
:| []
]
(CheckedFinalPreludeFoundationAuthorization tag)
authorizeCheckedFinalPreludeFoundationClaim
:: CheckedFinalPreludeFoundationAuthorization
-> [NonEmpty Declaration.ReservedCandidate]
-> Declaration.Declaration ()
authorizeCheckedFinalPreludeFoundationClaim
(CheckedFinalPreludeFoundationAuthorization tag) = \case
[candidate :| []] ->
Declaration.authorizeKernelConstructionCandidate
(Authority.FoundationLeaf tag)
candidate
(pure (foundationFactDerivation tag))
stages ->
Declaration.failDeclaration
(Declaration.CheckedAuthorizationCandidateShapeMismatch
1 (length stages))
preparedProofFirstOmission :: PreparedProof -> Maybe Location
preparedProofFirstOmission = \case
PreparedImplicitAuto{} -> Nothing
PreparedQed{} -> Nothing
PreparedOmitted location _goal -> Just location
PreparedFix _identities continuation ->
preparedProofFirstOmission continuation
PreparedAssume _antecedent continuation ->
preparedProofFirstOmission continuation
PreparedTake _identities _witness _discharge continuation ->
preparedProofFirstOmission continuation
PreparedSetInduction
(PreparedCheckedSetInduction
_focus _property _antecedents _target
_hypothesis _result child) ->
preparedProofFirstOmission child
PreparedHave _claim _discharge continuation ->
preparedProofFirstOmission continuation
PreparedSuffices _goal _reduction _implication _discharge continuation ->
preparedProofFirstOmission continuation
PreparedCalculate _calculation continuation ->
preparedProofFirstOmission continuation
PreparedSince _since _evidence _claim _discharge continuation ->
preparedProofFirstOmission continuation
PreparedSubclaim _claim subproof continuation ->
preparedProofFirstOmission subproof
<|> preparedProofFirstOmission continuation
PreparedDefine _identity _body _definition continuation ->
preparedProofFirstOmission continuation
PreparedDefineRelational
_identity _body _functionality _definitions continuation ->
preparedProofFirstOmission continuation
PreparedDefineFunction _identity _graph _definition continuation ->
preparedProofFirstOmission continuation
PreparedByCase (PreparedCaseAnalysis _goal cases _exhaustive _discharge) ->
foldr
((<|>) . preparedProofFirstOmission . preparedCaseProof)
Nothing
cases
PreparedByContradiction _goal _negation _falsum child ->
preparedProofFirstOmission child
PreparedContradiction{} -> Nothing
plannedProofRequests
:: PreparedProof
-> [Declaration.CheckedPlannedVampireRequest]
plannedProofRequests = \case
PreparedImplicitAuto discharge -> plannedDischargeRequests discharge
PreparedQed discharge -> plannedDischargeRequests discharge
PreparedOmitted{} -> []
PreparedFix _identities continuation ->
plannedProofRequests continuation
PreparedAssume _antecedent continuation ->
plannedProofRequests continuation
PreparedTake _identities _witness discharge continuation ->
plannedDischargeRequests discharge <> plannedProofRequests continuation
PreparedSetInduction
(PreparedCheckedSetInduction
_focus _property _antecedents _target
_hypothesis _result child) ->
plannedProofRequests child
PreparedHave _claim discharge continuation ->
plannedDischargeRequests discharge <> plannedProofRequests continuation
PreparedSuffices _goal _reduction _implication discharge continuation ->
plannedDischargeRequests discharge <> plannedProofRequests continuation
PreparedCalculate calculation continuation ->
plannedCalculationRequests calculation
<> plannedProofRequests continuation
PreparedSince _since evidence _claim discharge continuation ->
plannedSinceEvidenceRequests evidence
<> plannedDischargeRequests discharge
<> plannedProofRequests continuation
PreparedSubclaim _claim subproof continuation ->
plannedProofRequests subproof <> plannedProofRequests continuation
PreparedDefine _identity _body _definition continuation ->
plannedProofRequests continuation
PreparedDefineRelational
_identity _body functionality _definitions continuation ->
plannedDischargeRequests functionality
<> plannedProofRequests continuation
PreparedDefineFunction _identity _graph _definition continuation ->
plannedProofRequests continuation
PreparedByCase
(PreparedCaseAnalysis _goal cases _exhaustive discharge) ->
concatMap
(plannedProofRequests . preparedCaseProof)
(toList cases)
<> plannedDischargeRequests discharge
PreparedByContradiction _goal _negation _falsum child ->
plannedProofRequests child
PreparedContradiction _goal _falsum discharge ->
plannedDischargeRequests discharge
plannedDischargeRequests
:: PreparedDischarge
-> [Declaration.CheckedPlannedVampireRequest]
plannedDischargeRequests = \case
PreparedVampireDischarge location _justification _goal obligation ->
[Declaration.checkedPlannedVampireRequest location obligation]
PreparedSetExtensionality{} -> []
plannedCalculationRequests
:: PreparedCalculation
-> [Declaration.CheckedPlannedVampireRequest]
plannedCalculationRequests
(PreparedCheckedCalculation
_operandType _identities _guard _first links _result) =
concatMap
(plannedDischargeRequests . preparedCalculationLinkDischarge)
(toList links)
plannedSinceEvidenceRequests
:: PreparedSinceEvidence
-> [Declaration.CheckedPlannedVampireRequest]
plannedSinceEvidenceRequests = \case
PreparedSinceExisting{} -> []
PreparedSinceDischarged discharge _local ->
plannedDischargeRequests discharge
executePreparedProof
:: PreparedProof
-> Declaration.CandidateProof ()
executePreparedProof = \case
PreparedImplicitAuto discharge ->
executeDischarge discharge
PreparedQed discharge ->
executeDischarge discharge
PreparedOmitted _location _goal ->
Declaration.recordOmittedUse
PreparedFix _identities continuation ->
executePreparedProof continuation
PreparedAssume _antecedent continuation ->
executePreparedProof continuation
PreparedTake _identities _witness discharge continuation -> do
executeDischarge discharge
executePreparedProof continuation
PreparedSetInduction
(PreparedCheckedSetInduction
_focus _property _antecedents _target
_hypothesis _result child) ->
executePreparedProof child
PreparedHave _claim discharge continuation -> do
executeDischarge discharge
executePreparedProof continuation
PreparedSuffices goal reduction implication discharge continuation -> do
executeDischarge discharge
executePreparedProof continuation
unless
(implyScopedCore reduction goal == Just implication)
(impossible "a prepared suffices implication diverged")
PreparedCalculate calculation continuation -> do
executePreparedCalculation calculation
executePreparedProof continuation
PreparedSince sinceProposition evidence _claim discharge continuation -> do
executeSinceEvidence sinceProposition evidence
executeDischarge discharge
executePreparedProof continuation
PreparedSubclaim _claim subproof continuation -> do
executePreparedProof subproof
executePreparedProof continuation
PreparedDefine _identity _body _definition continuation ->
executePreparedProof continuation
PreparedDefineRelational
_identity _body functionality _definitions continuation -> do
executeDischarge functionality
executePreparedProof continuation
PreparedDefineFunction _identity _graph _definition continuation ->
executePreparedProof continuation
PreparedByCase
(PreparedCaseAnalysis _goal cases _exhaustive discharge) -> do
traverse_ (executePreparedProof . preparedCaseProof) cases
executeDischarge discharge
PreparedByContradiction _goal _negation _falsum child ->
executePreparedProof child
PreparedContradiction _goal _falsum discharge ->
executeDischarge discharge
executeDischarge
:: PreparedDischarge
-> Declaration.CandidateProof ()
executeDischarge
(PreparedVampireDischarge
location _justification _goal obligation) =
Declaration.locateProofObligation location
(Declaration.acceptPreparedVampireObligation obligation)
executeDischarge PreparedSetExtensionality{} =
pure ()
executePreparedCalculation
:: PreparedCalculation
-> Declaration.CandidateProof ()
executePreparedCalculation
(PreparedCheckedCalculation
_operandType _identities _guard _first links _result) =
traverse_
(executeDischarge . preparedCalculationLinkDischarge)
links
executeSinceEvidence
:: ScopedCheckedCore ObjectId
-> PreparedSinceEvidence
-> Declaration.CandidateProof ()
executeSinceEvidence proposition = \case
PreparedSinceExisting local ->
unless (preparedLocalProposition local == proposition)
(impossible "a structural since premise diverged")
PreparedSinceDischarged discharge local -> do
executeDischarge discharge
unless
( preparedDischargeGoal discharge == proposition
&& preparedLocalProposition local == proposition
)
(impossible "a discharged since premise diverged")
preparedLocalProposition
:: PreparedLocal
-> ScopedCheckedCore ObjectId
preparedLocalProposition
(PreparedLocal _ordinal _origin _support proposition) =
proposition
encodePreparedProof :: PreparedProof -> ByteString
encodePreparedProof =
encodeCache . putPreparedProof
putPreparedProof :: PreparedProof -> CachePut
putPreparedProof = \case
PreparedImplicitAuto discharge -> do
putCacheTag 0x00
putPreparedDischarge discharge
PreparedQed discharge -> do
putCacheTag 0x01
putPreparedDischarge discharge
PreparedOmitted _location goal -> do
putCacheTag 0x06
putScopedProposition goal
PreparedFix identities continuation -> do
putCacheTag 0x02
putCacheList
(putCacheNatural . Exact.exactLocalIdValue)
identities
putPreparedProof continuation
PreparedAssume antecedent continuation -> do
putCacheTag 0x03
putScopedProposition antecedent
putPreparedProof continuation
PreparedTake identities witness discharge continuation -> do
putCacheTag 0x08
putCacheList
(putCacheNatural . Exact.exactLocalIdValue)
identities
putScopedProposition witness
putPreparedDischarge discharge
putPreparedProof continuation
PreparedSetInduction
(PreparedCheckedSetInduction
focus property antecedents target hypothesis result child) -> do
putCacheTag 0x07
putPreparedSetInductionFocus focus
putScopedProposition property
putCacheList putScopedProposition antecedents
putScopedProposition target
putScopedProposition hypothesis
putScopedProposition result
putPreparedProof child
PreparedHave claim discharge continuation -> do
putCacheTag 0x04
putScopedProposition claim
putPreparedDischarge discharge
putPreparedProof continuation
PreparedSuffices goal reduction implication discharge continuation -> do
putCacheTag 0x0c
putScopedProposition goal
putScopedProposition reduction
putScopedProposition implication
putPreparedDischarge discharge
putPreparedProof continuation
PreparedCalculate calculation continuation -> do
putCacheTag 0x0d
putPreparedCalculation calculation
putPreparedProof continuation
PreparedSince sinceProposition evidence claim discharge continuation -> do
putCacheTag 0x0e
putScopedProposition sinceProposition
putPreparedSinceEvidence evidence
putScopedProposition claim
putPreparedDischarge discharge
putPreparedProof continuation
PreparedSubclaim claim subproof continuation -> do
putCacheTag 0x05
putScopedProposition claim
putPreparedProof subproof
putPreparedProof continuation
PreparedDefine identity body definitions continuation -> do
putCacheTag 0x09
putCacheNatural (Exact.exactLocalIdValue identity)
putScopedTerm body
putCacheList putScopedProposition (toList definitions)
putPreparedProof continuation
PreparedDefineRelational
identity body functionality definitions continuation -> do
putCacheTag 0x11
putCacheNatural (Exact.exactLocalIdValue identity)
putScopedTerm body
putPreparedDischarge functionality
putCacheList putScopedProposition (toList definitions)
putPreparedProof continuation
PreparedByCase caseAnalysis -> do
putCacheTag 0x0f
putPreparedCaseAnalysis caseAnalysis
PreparedByContradiction goal negation falsum child -> do
putCacheTag 0x10
putScopedProposition goal
putScopedProposition negation
putScopedProposition falsum
putPreparedProof child
PreparedContradiction goal falsum discharge -> do
putCacheTag 0x0a
putScopedProposition goal
putScopedProposition falsum
putPreparedDischarge discharge
PreparedDefineFunction identity graph definition continuation -> do
putCacheTag 0x0b
putCacheNatural (Exact.exactLocalIdValue identity)
putScopedTerm graph
putScopedProposition definition
putPreparedProof continuation
putPreparedSetInductionFocus
:: PreparedSetInductionFocus
-> CachePut
putPreparedSetInductionFocus = \case
PreparedInitialSetInductionFocus identity index -> do
putCacheTag 0x00
putCacheNatural (Exact.exactLocalIdValue identity)
putCacheNatural index
PreparedLeadingSetInductionFocus identity -> do
putCacheTag 0x01
putCacheNatural (Exact.exactLocalIdValue identity)
putPreparedDischarge :: PreparedDischarge -> CachePut
putPreparedDischarge
(PreparedVampireDischarge
_location justification goal _obligation) = do
putPreparedDischargeSyntax justification goal
putPreparedDischarge
(PreparedSetExtensionality _location goal) = do
putCacheTag 0x03
putScopedProposition goal
putPreparedDischargeSyntax
:: PreparedJustification
-> ScopedCheckedCore ObjectId
-> CachePut
putPreparedDischargeSyntax justification goal = do
putPreparedJustification justification
putScopedProposition goal
putPreparedCalculation :: PreparedCalculation -> CachePut
putPreparedCalculation
(PreparedCheckedCalculation
operandType identities calculationGuard first links result) = do
putCoreTypeCache operandType
putCacheList
(putCacheNatural . Exact.exactLocalIdValue)
identities
putCacheMaybe putScopedProposition calculationGuard
putCacheList putScopedTerm
(first : (preparedCalculationLinkDestination <$> toList links))
putCacheList putPreparedDischarge
(preparedCalculationLinkDischarge <$> toList links)
putScopedProposition result
putPreparedSinceEvidence :: PreparedSinceEvidence -> CachePut
putPreparedSinceEvidence = \case
PreparedSinceExisting local -> do
putCacheTag 0x00
putPreparedLocalEvidence local
PreparedSinceDischarged discharge local -> do
putCacheTag 0x01
putPreparedDischarge discharge
putPreparedLocalEvidence local
putPreparedCaseAnalysis :: PreparedCaseAnalysis -> CachePut
putPreparedCaseAnalysis
(PreparedCaseAnalysis goal cases exhaustive discharge) = do
putScopedProposition goal
putCacheList putPreparedCase (toList cases)
putScopedProposition exhaustive
putPreparedDischarge discharge
putPreparedCase :: PreparedCase -> CachePut
putPreparedCase (PreparedCase assumption proof) = do
putScopedProposition assumption
putPreparedProof proof
putPreparedLocalEvidence :: PreparedLocal -> CachePut
putPreparedLocalEvidence
(PreparedLocal ordinal _origin support proposition) = do
putCacheNatural (Backend.localPremiseOrdinalValue ordinal)
putCacheList
(\(identity, coreType) -> do
putCacheNatural (Exact.exactLocalIdValue identity)
putCoreTypeCache coreType)
(Vector.toList support)
putScopedProposition proposition
implicitAutoProofSyntaxId
:: ScopedCheckedCore ObjectId
-> ProofSyntaxId
implicitAutoProofSyntaxId goal =
proofSyntaxId
(encodeCache do
putCacheTag 0x00
putPreparedDischargeSyntax PreparedAuto goal)
putPreparedJustification :: PreparedJustification -> CachePut
putPreparedJustification = \case
PreparedAuto ->
putCacheTag 0x00
PreparedReferences fingerprints -> do
putCacheTag 0x01
putCacheList
putSemanticFactOccurrenceFingerprintCache
(toList fingerprints)
PreparedLocalOnly ->
putCacheTag 0x02
putScopedProposition
:: ScopedCheckedCore ObjectId
-> CachePut
putScopedProposition proposition = do
putCacheList putCoreTypeCache
(scopedCoreContext proposition)
putCanonicalTermCache putObjectIdCache
(scopedCoreTerm proposition)
putScopedTerm
:: ScopedCheckedCore ObjectId
-> CachePut
putScopedTerm term = do
putCacheList putCoreTypeCache
(scopedCoreContext term)
putCoreTypeCache (scopedCoreType term)
putCanonicalTermCache putObjectIdCache
(scopedCoreTerm term)
proofLocation :: Location -> Raw.Proof -> Location
proofLocation fallback = \case
Raw.Omitted location -> location
Raw.Qed maybeLocation _justification ->
fromMaybe fallback maybeLocation
Raw.Contradiction location _justification -> location
Raw.ByCase location _cases -> location
Raw.ByContradiction location _proof -> location
Raw.BySetInduction location _term _proof -> location
Raw.ByOrdInduction location _proof -> location
Raw.Assume location _statement _proof -> location
Raw.FixSymbolic location _variables _bound _proof -> location
Raw.FixSuchThat location _variables _statement _proof -> location
Raw.Calc location _quantifier _calculation _proof -> location
Raw.TakeVar location _variables _bound _statement _justification _proof ->
location
Raw.TakeNoun location _noun _justification _proof -> location
Raw.Have location _since _statement _justification _proof -> location
Raw.Suffices location _statement _justification _proof -> location
Raw.Subclaim location _statement _subproof _proof -> location
Raw.Define location _variable _expression _proof -> location
Raw.DefineFunction location _function _argument _value _bound _domain _proof ->
location
Raw.DefineFunctionLocal
location _function _argument _value _bound _target _rules _proof ->
location
throwProof :: ExactProofError -> Prepare value
throwProof =
State.lift . Except.throwError
liftDriver
:: Declaration.LoweringDriver value
-> Prepare value
liftDriver =
State.lift . Except.lift
stableUnique :: Ord value => [value] -> [value]
stableUnique =
reverse . snd
. foldl'
(\(seen, reversed) value ->
if value `Set.member` seen
then (seen, reversed)
else
( Set.insert value seen
, value : reversed
))
(Set.empty, [])
|