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
|
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE NoImplicitPrelude #-}
-- | Checked monomorphic HOL syntax and its nameless in-memory form.
--
-- Scoped syntax is an operational construction language. Only a checked,
-- frozen value is semantic input to later kernel and backend boundaries.
module Felix.Checking.Core
( CoreType(..)
, CoreIntrinsicTag(..)
, coreIntrinsicType
, CoreSyntax
, coreLocal
, coreGlobal
, coreIntrinsic
, coreOpaqueInteger
, coreApply
, coreLambda
, coreFalsum
, coreImplication
, coreEquality
, coreForall
, CheckedCore
, checkedCoreType
, checkCore
, checkClosedCore
, ClosedCheckedProposition
, checkedPropositionCore
, checkClosedProposition
, CoreCheckError(..)
, CanonicalTerm(..)
, canonicalSetInsert
, FrozenCheckedCore
, frozenCoreType
, frozenCoreTerm
, thawFrozenCore
, frozenCoreGlobals
, mapFrozenGlobals
, ScopedCheckedCore
, scopedCoreContext
, scopedCoreType
, scopedCoreTerm
, mapScopedGlobals
, checkScopedCanonicalCore
, embedClosedCore
, weakenCheckedScopedCore
, weakenScopedCore
, scopedSetDefinition
, scopedCharacteristicDefinition
, scopedReplacementGraph
, implyScopedCore
, equalScopedCore
, conjoinScopedCore
, disjoinScopedCore
, negateScopedCore
, falsumScopedCore
, splitScopedSetEquality
, scopedSetInductionInstance
, closeScopedForall
, closeScopedExists
, openScopedForall
, openScopedImplication
, openScopedAssumption
, closeScopedCore
, betaNormalizeCanonical
, instantiateCanonical
, shiftCanonical
, mapCanonicalGlobals
, canonicalTermGlobals
, checkCanonicalCore
, freezeClosed
, FreezeError(..)
, referenceFreezeClosed
) where
import Base hiding (Empty)
import Bound
import Control.DeepSeq (NFData)
import Control.Monad (ap, unless)
import Data.Set qualified as Set
import Numeric.Natural (Natural)
-- | The complete monomorphic type grammar of the checked core.
data CoreType
= TyProp
| TySet
| TyArrow !CoreType !CoreType
deriving stock (Show, Eq, Ord, Generic)
deriving anyclass (NFData)
-- | The complete set-forming primitive inventory.
data CoreIntrinsicTag
= Member
| Empty
| PairSet
| FamilyUnion
| PowerSet
| Sep
| Repl
| SetChoose
| UnivOf
-- | The bounded set-valued least fixed point. It denotes the elements of
-- its bound that belong to every bounded pre-fixed point of its operator.
| ISetLfp
deriving stock (Show, Eq, Ord, Enum, Bounded, Generic)
deriving anyclass (NFData)
coreIntrinsicType :: CoreIntrinsicTag -> CoreType
coreIntrinsicType = \case
Member ->
TySet `TyArrow` (TySet `TyArrow` TyProp)
Empty ->
TySet
PairSet ->
TySet `TyArrow` (TySet `TyArrow` TySet)
FamilyUnion ->
TySet `TyArrow` TySet
PowerSet ->
TySet `TyArrow` TySet
Sep ->
TySet
`TyArrow`
((TySet `TyArrow` TyProp) `TyArrow` TySet)
Repl ->
TySet
`TyArrow`
((TySet `TyArrow` TySet) `TyArrow` TySet)
SetChoose ->
(TySet `TyArrow` TyProp) `TyArrow` TySet
UnivOf ->
TySet `TyArrow` TySet
ISetLfp ->
TySet
`TyArrow`
((TySet `TyArrow` TySet) `TyArrow` TySet)
-- | Operational scoped syntax. Its constructors remain private because this
-- value is neither a typing certificate nor an authority-bearing term.
data CoreSyntax global local
= CoreLocal local
| CoreGlobal global
| CoreIntrinsic CoreIntrinsicTag
| CoreOpaqueInteger !Integer
| CoreApply
!(CoreSyntax global local)
!(CoreSyntax global local)
| CoreLambda
!CoreType
!(Scope () (CoreSyntax global) local)
| CoreFalsum
| CoreImplication
!(CoreSyntax global local)
!(CoreSyntax global local)
| CoreEquality
!CoreType
!(CoreSyntax global local)
!(CoreSyntax global local)
| CoreForall
!CoreType
!(Scope () (CoreSyntax global) local)
deriving stock (Functor, Foldable, Traversable)
instance Applicative (CoreSyntax global) where
pure = CoreLocal
(<*>) = ap
instance Monad (CoreSyntax global) where
CoreLocal local >>= replace =
replace local
CoreGlobal global >>= _replace =
CoreGlobal global
CoreIntrinsic intrinsic >>= _replace =
CoreIntrinsic intrinsic
CoreOpaqueInteger integer >>= _replace =
CoreOpaqueInteger integer
CoreApply function argument >>= replace =
CoreApply
(function >>= replace)
(argument >>= replace)
CoreLambda binderType body >>= replace =
CoreLambda binderType (body >>>= replace)
CoreFalsum >>= _replace =
CoreFalsum
CoreImplication premise conclusion >>= replace =
CoreImplication
(premise >>= replace)
(conclusion >>= replace)
CoreEquality operandType left right >>= replace =
CoreEquality
operandType
(left >>= replace)
(right >>= replace)
CoreForall binderType body >>= replace =
CoreForall binderType (body >>>= replace)
coreLocal :: local -> CoreSyntax global local
coreLocal = CoreLocal
coreGlobal :: global -> CoreSyntax global local
coreGlobal = CoreGlobal
coreIntrinsic :: CoreIntrinsicTag -> CoreSyntax global local
coreIntrinsic = CoreIntrinsic
coreOpaqueInteger :: Integer -> CoreSyntax global local
coreOpaqueInteger = CoreOpaqueInteger
coreApply
:: CoreSyntax global local
-> CoreSyntax global local
-> CoreSyntax global local
coreApply = CoreApply
coreLambda
:: Eq local
=> CoreType
-> local
-> CoreSyntax global local
-> CoreSyntax global local
coreLambda binderType local body =
CoreLambda binderType (abstract1 local body)
coreFalsum :: CoreSyntax global local
coreFalsum = CoreFalsum
coreImplication
:: CoreSyntax global local
-> CoreSyntax global local
-> CoreSyntax global local
coreImplication = CoreImplication
coreEquality
:: CoreType
-> CoreSyntax global local
-> CoreSyntax global local
-> CoreSyntax global local
coreEquality = CoreEquality
coreForall
:: Eq local
=> CoreType
-> local
-> CoreSyntax global local
-> CoreSyntax global local
coreForall binderType local body =
CoreForall binderType (abstract1 local body)
data CoreCheckError
= UnknownCoreGlobal
| UnboundCoreLocal
| UnboundCoreIndex !Natural
| AppliedNonFunction !CoreType
| ApplicationArgumentTypeMismatch
!CoreType
!CoreType
| ImplicationOperandTypeMismatch
!CoreType
| EqualityOperandTypeMismatch
!CoreType
!CoreType
| QuantifierBodyTypeMismatch
!CoreType
| ExpectedCoreType
!CoreType
!CoreType
deriving stock (Show, Eq)
-- | A scoped term whose complete tree has been type checked.
data CheckedCore global local = CheckedCore
!CoreType
!(CoreSyntax global local)
checkedCoreType :: CheckedCore global local -> CoreType
checkedCoreType (CheckedCore coreType _syntax) =
coreType
checkCore
:: (global -> Maybe CoreType)
-> (local -> Maybe CoreType)
-> CoreSyntax global local
-> Either CoreCheckError (CheckedCore global local)
checkCore globalType localType syntax = do
coreType <-
inferCore globalType localType syntax
pure (CheckedCore coreType syntax)
checkClosedCore
:: (global -> Maybe CoreType)
-> CoreSyntax global local
-> Either CoreCheckError (CheckedCore global Void)
checkClosedCore globalType syntax = do
closedSyntax <-
maybe
(Left UnboundCoreLocal)
Right
(traverse (const Nothing) syntax)
checkCore globalType absurd closedSyntax
newtype ClosedCheckedProposition global =
ClosedCheckedProposition (CheckedCore global Void)
checkedPropositionCore
:: ClosedCheckedProposition global
-> CheckedCore global Void
checkedPropositionCore
(ClosedCheckedProposition proposition) =
proposition
checkClosedProposition
:: (global -> Maybe CoreType)
-> CoreSyntax global local
-> Either CoreCheckError (ClosedCheckedProposition global)
checkClosedProposition globalType syntax = do
checked <-
checkClosedCore globalType syntax
unless
(checkedCoreType checked == TyProp)
(Left
(ExpectedCoreType
TyProp
(checkedCoreType checked)))
pure (ClosedCheckedProposition checked)
inferCore
:: forall global local
. (global -> Maybe CoreType)
-> (local -> Maybe CoreType)
-> CoreSyntax global local
-> Either CoreCheckError CoreType
inferCore globalType localType =
infer
(maybe
(Left UnboundCoreLocal)
Right
. localType)
where
infer
:: forall local'
. (local' -> Either CoreCheckError CoreType)
-> CoreSyntax global local'
-> Either CoreCheckError CoreType
infer resolveLocal = \case
CoreLocal local ->
resolveLocal local
CoreGlobal global ->
maybe
(Left UnknownCoreGlobal)
Right
(globalType global)
CoreIntrinsic intrinsic ->
Right (coreIntrinsicType intrinsic)
CoreOpaqueInteger{} ->
Right TySet
CoreApply function argument -> do
functionType <-
infer resolveLocal function
argumentType <-
infer resolveLocal argument
case functionType of
TyArrow expectedArgument resultType
| expectedArgument == argumentType ->
Right resultType
| otherwise ->
Left
(ApplicationArgumentTypeMismatch
expectedArgument
argumentType)
other ->
Left (AppliedNonFunction other)
CoreLambda binderType body -> do
bodyType <-
infer
(boundLocalType binderType resolveLocal)
(unscope body)
Right (binderType `TyArrow` bodyType)
CoreFalsum ->
Right TyProp
CoreImplication premise conclusion -> do
premiseType <-
infer resolveLocal premise
unless
(premiseType == TyProp)
(Left
(ImplicationOperandTypeMismatch
premiseType))
conclusionType <-
infer resolveLocal conclusion
unless
(conclusionType == TyProp)
(Left
(ImplicationOperandTypeMismatch
conclusionType))
Right TyProp
CoreEquality operandType left right -> do
leftType <-
infer resolveLocal left
unless
(leftType == operandType)
(Left
(EqualityOperandTypeMismatch
operandType
leftType))
rightType <-
infer resolveLocal right
unless
(rightType == operandType)
(Left
(EqualityOperandTypeMismatch
operandType
rightType))
Right TyProp
CoreForall binderType body -> do
bodyType <-
infer
(boundLocalType binderType resolveLocal)
(unscope body)
unless
(bodyType == TyProp)
(Left
(QuantifierBodyTypeMismatch bodyType))
Right TyProp
boundLocalType
:: forall local'
. CoreType
-> (local' -> Either CoreCheckError CoreType)
-> Var () (CoreSyntax global local')
-> Either CoreCheckError CoreType
boundLocalType binderType outerType = \case
B () ->
Right binderType
F outerSyntax ->
infer outerType outerSyntax
-- | Felix-owned explicit-index syntax. Index zero denotes the nearest
-- enclosing binder.
data CanonicalTerm global
= CBound !Natural
| CGlobal !global
| CIntrinsic !CoreIntrinsicTag
| COpaqueInteger !Integer
| CApp
!(CanonicalTerm global)
!(CanonicalTerm global)
| CLam
!CoreType
!(CanonicalTerm global)
| CFalsum
| CImp
!(CanonicalTerm global)
!(CanonicalTerm global)
| CEq
!CoreType
!(CanonicalTerm global)
!(CanonicalTerm global)
| CForall
!CoreType
!(CanonicalTerm global)
deriving stock (Show, Eq, Ord, Generic)
deriving anyclass (NFData)
-- | The fixed checked-core interpretation of set insertion.
--
-- Finite-set notation uses this intrinsic HOTG adjunction directly. The
-- ordinary source-owned @cons@ function is not consulted during lowering.
canonicalSetInsert
:: CanonicalTerm global
-> CanonicalTerm global
-> CanonicalTerm global
canonicalSetInsert element set =
CApp
(CIntrinsic FamilyUnion)
(CApp
(CApp
(CIntrinsic PairSet)
(CApp
(CApp
(CIntrinsic PairSet)
element)
element))
set)
data FrozenCheckedCore global = FrozenCheckedCore
!CoreType
!(CanonicalTerm global)
deriving stock (Show, Eq, Ord, Generic)
deriving anyclass (NFData)
frozenCoreType :: FrozenCheckedCore global -> CoreType
frozenCoreType (FrozenCheckedCore coreType _term) =
coreType
frozenCoreTerm :: FrozenCheckedCore global -> CanonicalTerm global
frozenCoreTerm (FrozenCheckedCore _coreType term) =
term
mapFrozenGlobals
:: (global -> global')
-> FrozenCheckedCore global
-> FrozenCheckedCore global'
mapFrozenGlobals transform
(FrozenCheckedCore coreType term) =
FrozenCheckedCore
coreType
(mapCanonicalGlobals transform term)
-- | Recover an operational closed term from a checked frozen value. Any caller
-- that extends or substitutes it must check the resulting term again.
thawFrozenCore
:: FrozenCheckedCore global
-> CoreSyntax global Void
thawFrozenCore (FrozenCheckedCore _coreType term) =
case traverse (const Nothing) (go [] term) of
Just closedSyntax ->
closedSyntax
Nothing ->
impossible
"a frozen core term became open while being thawed"
where
go
:: [Natural]
-> CanonicalTerm global
-> CoreSyntax global Natural
go binders = \case
CBound index ->
case lookupBinder index binders of
Just local ->
coreLocal local
Nothing ->
impossible
"a frozen core term contains an unbound index"
CGlobal global ->
coreGlobal global
CIntrinsic intrinsic ->
coreIntrinsic intrinsic
COpaqueInteger integer ->
coreOpaqueInteger integer
CApp function argument ->
coreApply
(go binders function)
(go binders argument)
CLam binderType body ->
let local =
fromIntegral (length binders)
in coreLambda
binderType
local
(go (local : binders) body)
CFalsum ->
coreFalsum
CImp premise conclusion ->
coreImplication
(go binders premise)
(go binders conclusion)
CEq operandType left right ->
coreEquality
operandType
(go binders left)
(go binders right)
CForall binderType body ->
let local =
fromIntegral (length binders)
in coreForall
binderType
local
(go (local : binders) body)
lookupBinder
:: Natural
-> [Natural]
-> Maybe Natural
lookupBinder _index [] =
Nothing
lookupBinder 0 (local : _rest) =
Just local
lookupBinder index (_local : rest) =
lookupBinder (index - 1) rest
frozenCoreGlobals
:: Ord global
=> FrozenCheckedCore global
-> Set.Set global
frozenCoreGlobals =
canonicalTermGlobals . frozenCoreTerm
canonicalTermGlobals
:: Ord global
=> CanonicalTerm global
-> Set.Set global
canonicalTermGlobals = \case
CBound{} ->
mempty
CGlobal global ->
Set.singleton global
CIntrinsic{} ->
mempty
COpaqueInteger{} ->
mempty
CApp function argument ->
canonicalTermGlobals function
<> canonicalTermGlobals argument
CLam _binderType body ->
canonicalTermGlobals body
CFalsum ->
mempty
CImp premise conclusion ->
canonicalTermGlobals premise
<> canonicalTermGlobals conclusion
CEq _operandType left right ->
canonicalTermGlobals left
<> canonicalTermGlobals right
CForall _binderType body ->
canonicalTermGlobals body
-- | A checked canonical term relative to the listed nearest-first binders.
-- This is the construction boundary used by kernel replay; it carries no fact
-- authority.
data ScopedCheckedCore global = ScopedCheckedCore
![CoreType]
!CoreType
!(CanonicalTerm global)
deriving stock (Show, Eq, Ord, Generic)
deriving anyclass (NFData)
scopedCoreContext
:: ScopedCheckedCore global
-> [CoreType]
scopedCoreContext
(ScopedCheckedCore context _coreType _term) =
context
scopedCoreType
:: ScopedCheckedCore global
-> CoreType
scopedCoreType
(ScopedCheckedCore _context coreType _term) =
coreType
scopedCoreTerm
:: ScopedCheckedCore global
-> CanonicalTerm global
scopedCoreTerm
(ScopedCheckedCore _context _coreType term) =
term
mapScopedGlobals
:: (left -> right)
-> ScopedCheckedCore left
-> ScopedCheckedCore right
mapScopedGlobals transform
(ScopedCheckedCore context coreType term) =
ScopedCheckedCore
context
coreType
(mapCanonicalGlobals transform term)
checkScopedCanonicalCore
:: (global -> Maybe CoreType)
-> [CoreType]
-> CanonicalTerm global
-> Either CoreCheckError (ScopedCheckedCore global)
checkScopedCanonicalCore globalType context term =
ScopedCheckedCore context
<$> inferCanonicalCore globalType context term
<*> pure term
-- | Regard a closed term under a larger lexical context. Closed canonical
-- terms contain no indices, so this does not shift the term.
embedClosedCore
:: [CoreType]
-> FrozenCheckedCore global
-> ScopedCheckedCore global
embedClosedCore context
(FrozenCheckedCore coreType term) =
ScopedCheckedCore context coreType term
-- | Add one nearest binder to an already checked lexical context.
weakenCheckedScopedCore
:: CoreType
-> ScopedCheckedCore global
-> ScopedCheckedCore global
weakenCheckedScopedCore binderType scoped =
ScopedCheckedCore
(binderType : scopedCoreContext scoped)
(scopedCoreType scoped)
(shiftCanonical 1 0 (scopedCoreTerm scoped))
-- | Add one nearest binder to a checked lexical context.
weakenScopedCore
:: (global -> Maybe CoreType)
-> CoreType
-> ScopedCheckedCore global
-> Either CoreCheckError (ScopedCheckedCore global)
weakenScopedCore globalType binderType scoped =
checkScopedCanonicalCore
globalType
(binderType : scopedCoreContext scoped)
(shiftCanonical 1 0
(scopedCoreTerm scoped))
-- | Introduce a fresh set-valued local definition. Separation specializes
-- the checked foundation characteristic so its local premise remains
-- first-order.
scopedSetDefinition
:: Eq global
=> FrozenCheckedCore Void
-> ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
scopedSetDefinition
characteristic
expression@(ScopedCheckedCore context TySet term) =
case term of
CApp
(CApp (CIntrinsic Sep) bound)
predicate@(CLam TySet _body) ->
scopedCharacteristicDefinition
characteristic
expression
( ScopedCheckedCore context TySet bound
:| [ ScopedCheckedCore
context
(TySet `TyArrow` TyProp)
predicate
]
)
_ ->
Just
(ScopedCheckedCore
(TySet : context)
TyProp
(CEq
TySet
(CBound 0)
(shiftCanonical 1 0 term)))
scopedSetDefinition _characteristic _expression =
Nothing
-- | Specialize a checked characteristic and abstract its set-valued target
-- into one fresh nearest binder. Checked substitution and beta reduction
-- preserve the foundation row's proposition type.
scopedCharacteristicDefinition
:: Eq global
=> FrozenCheckedCore Void
-> ScopedCheckedCore global
-> NonEmpty (ScopedCheckedCore global)
-> Maybe (ScopedCheckedCore global)
scopedCharacteristicDefinition
(FrozenCheckedCore TyProp frozen)
(ScopedCheckedCore context TySet target)
arguments
| all ((== context) . scopedCoreContext) arguments = do
specialized <-
specialize
(mapCanonicalGlobals absurd frozen)
(toList arguments)
let normalized = betaNormalizeCanonical specialized
(found, abstracted) = abstractTarget 0 normalized
guard found
pure
(ScopedCheckedCore
(TySet : context)
TyProp
abstracted)
where
specialize term [] =
Just term
specialize (CForall binderType body)
(ScopedCheckedCore _ argumentType argument : rest)
| binderType == argumentType =
specialize
(instantiateCanonical argument body)
rest
specialize _term _arguments =
Nothing
abstractTarget depth term
| term == shiftCanonical depth 0 target =
(True, CBound (fromIntegral depth))
| otherwise =
case term of
CBound index
| index < fromIntegral depth ->
(False, CBound index)
| otherwise ->
(False, CBound (index + 1))
CGlobal global ->
(False, CGlobal global)
CIntrinsic intrinsic ->
(False, CIntrinsic intrinsic)
COpaqueInteger integer ->
(False, COpaqueInteger integer)
CApp function argument ->
combine CApp
(abstractTarget depth function)
(abstractTarget depth argument)
CLam binderType body ->
let (found, abstracted) =
abstractTarget (depth + 1) body
in (found, CLam binderType abstracted)
CFalsum ->
(False, CFalsum)
CImp premise conclusion ->
combine CImp
(abstractTarget depth premise)
(abstractTarget depth conclusion)
CEq operandType left right ->
combine (CEq operandType)
(abstractTarget depth left)
(abstractTarget depth right)
CForall binderType body ->
let (found, abstracted) =
abstractTarget (depth + 1) body
in (found, CForall binderType abstracted)
combine constructor (leftFound, left) (rightFound, right) =
(leftFound || rightFound, constructor left right)
scopedCharacteristicDefinition _characteristic _target _arguments =
Nothing
-- | Build the replacement graph of one checked set-valued local function.
-- The ordered-pair constructor is an ordinary checked source object.
scopedReplacementGraph
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
, ScopedCheckedCore global
)
scopedReplacementGraph
(ScopedCheckedCore context pairType pair)
domain@(ScopedCheckedCore domainContext TySet domainTerm)
(ScopedCheckedCore valueContext TySet value)
| pairType == TySet `TyArrow` (TySet `TyArrow` TySet)
, domainContext == context
, valueContext == TySet : context =
let pairValue =
CApp
(CApp
(shiftCanonical 1 0 pair)
(CBound 0))
value
function = CLam TySet pairValue
graph =
CApp
(CApp (CIntrinsic Repl) domainTerm)
function
in Just
( ScopedCheckedCore context TySet graph
, domain
, ScopedCheckedCore
context
(TySet `TyArrow` TySet)
function
)
scopedReplacementGraph _pair _domain _value =
Nothing
betaNormalizeCanonical
:: CanonicalTerm global
-> CanonicalTerm global
betaNormalizeCanonical = \case
CApp function argument ->
case betaNormalizeCanonical function of
CLam _binderType body ->
betaNormalizeCanonical
(instantiateCanonical
(betaNormalizeCanonical argument)
body)
normalizedFunction ->
CApp
normalizedFunction
(betaNormalizeCanonical argument)
CLam binderType body ->
CLam binderType (betaNormalizeCanonical body)
CImp premise conclusion ->
CImp
(betaNormalizeCanonical premise)
(betaNormalizeCanonical conclusion)
CEq operandType left right ->
CEq operandType
(betaNormalizeCanonical left)
(betaNormalizeCanonical right)
CForall binderType body ->
CForall binderType (betaNormalizeCanonical body)
term -> term
-- | Combine two checked propositions under the same lexical context.
implyScopedCore
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
implyScopedCore
(ScopedCheckedCore premiseContext TyProp premise)
(ScopedCheckedCore conclusionContext TyProp conclusion)
| premiseContext == conclusionContext =
Just
(ScopedCheckedCore
premiseContext
TyProp
(CImp premise conclusion))
implyScopedCore _premise _conclusion =
Nothing
-- | Form an equality between checked operands under the same lexical
-- context. This preserves the checked-core invariant without requiring a
-- caller to recover global types merely to combine already checked terms.
equalScopedCore
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
equalScopedCore
(ScopedCheckedCore leftContext leftType left)
(ScopedCheckedCore rightContext rightType right)
| leftContext == rightContext
, leftType == rightType =
Just
(ScopedCheckedCore
leftContext
TyProp
(CEq leftType left right))
equalScopedCore _left _right =
Nothing
-- | Conjoin two checked propositions under the same lexical context. Truth
-- is normalized away so callers can build an optional source guard without
-- retaining an inert conjunct.
conjoinScopedCore
:: Eq global
=> ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
conjoinScopedCore
left@(ScopedCheckedCore leftContext TyProp leftTerm)
right@(ScopedCheckedCore rightContext TyProp rightTerm)
| leftContext == rightContext
, leftTerm == truth = Just right
| leftContext == rightContext
, rightTerm == truth = Just left
| leftContext == rightContext =
Just
(ScopedCheckedCore
leftContext
TyProp
(CImp
(CImp leftTerm (CImp rightTerm CFalsum))
CFalsum))
where
truth = CImp CFalsum CFalsum
conjoinScopedCore _left _right =
Nothing
-- | Disjoin two checked propositions under the same lexical context using
-- the fixed classical encoding owned by the checked core.
disjoinScopedCore
:: ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
disjoinScopedCore
(ScopedCheckedCore leftContext TyProp left)
(ScopedCheckedCore rightContext TyProp right)
| leftContext == rightContext =
Just
(ScopedCheckedCore
leftContext
TyProp
(CImp (CImp left CFalsum) right))
disjoinScopedCore _left _right =
Nothing
-- | Negate a checked proposition without changing its lexical context.
negateScopedCore
:: ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
negateScopedCore (ScopedCheckedCore context TyProp proposition) =
Just
(ScopedCheckedCore
context
TyProp
(CImp proposition CFalsum))
negateScopedCore _proposition =
Nothing
-- | Checked falsum at an already established lexical context.
falsumScopedCore :: [CoreType] -> ScopedCheckedCore global
falsumScopedCore context =
ScopedCheckedCore context TyProp CFalsum
-- | Split a checked set equality into its two extensionality directions.
splitScopedSetEquality
:: ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
)
splitScopedSetEquality
(ScopedCheckedCore context TyProp (CEq TySet left right)) =
Just (subset left right, subset right left)
where
subset source target =
ScopedCheckedCore
context
TyProp
(CForall
TySet
(CImp
(memberOf (shiftCanonical 1 0 source))
(memberOf (shiftCanonical 1 0 target))))
memberOf set =
CApp
(CApp
(CIntrinsic Member)
(CBound 0))
set
splitScopedSetEquality _proposition =
Nothing
-- | Derive the exact predicate, member-wise hypothesis, induction step, and
-- binder-level result for one set-valued ambient binder. The selected binder
-- is replaced by the newly introduced set variable; every other ambient
-- binder remains a parameter.
scopedSetInductionInstance
:: Natural
-> ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
, ScopedCheckedCore global
, ScopedCheckedCore global
)
scopedSetInductionInstance selected
(ScopedCheckedCore context TyProp property)
| binderTypeAt selected context == Just TySet =
Just (predicate, hypothesis, step, result)
where
abstractedProperty = abstractSelected 0 property
predicate =
ScopedCheckedCore
context
(TySet `TyArrow` TyProp)
(CLam TySet abstractedProperty)
hypothesis =
ScopedCheckedCore
context
TyProp
(CForall
TySet
(CImp
(CApp
(CApp
(CIntrinsic Member)
(CBound 0))
(CBound (selected + 1)))
abstractedProperty))
step =
ScopedCheckedCore
context
TyProp
(CForall
TySet
(CImp
(abstractSelected
0
(scopedCoreTerm hypothesis))
abstractedProperty))
result =
ScopedCheckedCore
context
TyProp
(CForall TySet abstractedProperty)
abstractSelected depth = \case
CBound index
| index == depth + selected ->
CBound depth
| index >= depth ->
CBound (index + 1)
| otherwise ->
CBound index
CGlobal global ->
CGlobal global
CIntrinsic intrinsic ->
CIntrinsic intrinsic
COpaqueInteger integer ->
COpaqueInteger integer
CApp function argument ->
CApp
(abstractSelected depth function)
(abstractSelected depth argument)
CLam binderType body ->
CLam binderType
(abstractSelected (depth + 1) body)
CFalsum ->
CFalsum
CImp premise conclusion ->
CImp
(abstractSelected depth premise)
(abstractSelected depth conclusion)
CEq operandType left right ->
CEq operandType
(abstractSelected depth left)
(abstractSelected depth right)
CForall binderType body ->
CForall binderType
(abstractSelected (depth + 1) body)
scopedSetInductionInstance _selected _property =
Nothing
-- | Close the nearest checked binder as one leading universal.
closeScopedForall
:: ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
closeScopedForall
(ScopedCheckedCore (binderType : context) TyProp body) =
Just
(ScopedCheckedCore
context
TyProp
(CForall binderType body))
closeScopedForall _scoped =
Nothing
-- | Close the nearest checked binder as one leading existential.
closeScopedExists
:: ScopedCheckedCore global
-> Maybe (ScopedCheckedCore global)
closeScopedExists
(ScopedCheckedCore (binderType : context) TyProp body) =
Just
(ScopedCheckedCore
context
TyProp
(CImp
(CForall binderType (CImp body CFalsum))
CFalsum))
closeScopedExists _scoped =
Nothing
-- | Open one checked leading universal without rechecking its body.
openScopedForall
:: ScopedCheckedCore global
-> Maybe (CoreType, ScopedCheckedCore global)
openScopedForall
(ScopedCheckedCore context TyProp
(CForall binderType body)) =
Just
( binderType
, ScopedCheckedCore
(binderType : context)
TyProp
body
)
openScopedForall _scoped =
Nothing
-- | Split one checked implication under its unchanged ambient context.
openScopedImplication
:: ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
)
openScopedImplication
(ScopedCheckedCore context TyProp
(CImp premise conclusion)) =
Just
( ScopedCheckedCore context TyProp premise
, ScopedCheckedCore context TyProp conclusion
)
openScopedImplication _scoped =
Nothing
-- | Open a checked proof assumption against the current goal. Besides a
-- direct implication antecedent, the source language historically permits
-- either immediate side of one binary conjunction antecedent to be assumed
-- first. The other side remains the next implication antecedent. This is a
-- deliberately shallow structural rule: it neither flattens conjunctions nor
-- treats disjunction as an eliminable assumption.
openScopedAssumption
:: Eq global
=> ScopedCheckedCore global
-> ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
)
openScopedAssumption supplied goal = do
(antecedent, conclusion) <- openScopedImplication goal
if supplied == antecedent
then pure (antecedent, conclusion)
else do
(left, right) <- splitScopedConjunction antecedent
if supplied == left
then do
remaining <- implyScopedCore right conclusion
pure (left, remaining)
else if supplied == right
then do
remaining <- implyScopedCore left conclusion
pure (right, remaining)
else Nothing
splitScopedConjunction
:: ScopedCheckedCore global
-> Maybe
( ScopedCheckedCore global
, ScopedCheckedCore global
)
splitScopedConjunction
(ScopedCheckedCore context TyProp
(CImp (CImp left (CImp right CFalsum)) CFalsum)) =
Just
( ScopedCheckedCore context TyProp left
, ScopedCheckedCore context TyProp right
)
splitScopedConjunction _scoped =
Nothing
closeScopedCore
:: ScopedCheckedCore global
-> Maybe (FrozenCheckedCore global)
closeScopedCore
(ScopedCheckedCore [] coreType term) =
Just (FrozenCheckedCore coreType term)
closeScopedCore ScopedCheckedCore{} =
Nothing
-- | Substitute an outer-context term for index zero and remove that binder.
instantiateCanonical
:: CanonicalTerm global
-> CanonicalTerm global
-> CanonicalTerm global
instantiateCanonical argument =
instantiateAt 0
where
instantiateAt depth = \case
CBound index
| index == depth ->
shiftCanonical depth 0 argument
| index > depth ->
CBound (index - 1)
| otherwise ->
CBound index
CGlobal global ->
CGlobal global
CIntrinsic intrinsic ->
CIntrinsic intrinsic
COpaqueInteger integer ->
COpaqueInteger integer
CApp function operand ->
CApp
(instantiateAt depth function)
(instantiateAt depth operand)
CLam binderType body ->
CLam binderType
(instantiateAt (depth + 1) body)
CFalsum ->
CFalsum
CImp premise conclusion ->
CImp
(instantiateAt depth premise)
(instantiateAt depth conclusion)
CEq operandType left right ->
CEq operandType
(instantiateAt depth left)
(instantiateAt depth right)
CForall binderType body ->
CForall binderType
(instantiateAt (depth + 1) body)
mapCanonicalGlobals
:: (global -> global')
-> CanonicalTerm global
-> CanonicalTerm global'
mapCanonicalGlobals transform = \case
CBound index ->
CBound index
CGlobal global ->
CGlobal (transform global)
CIntrinsic intrinsic ->
CIntrinsic intrinsic
COpaqueInteger integer ->
COpaqueInteger integer
CApp function argument ->
CApp
(mapCanonicalGlobals transform function)
(mapCanonicalGlobals transform argument)
CLam binderType body ->
CLam binderType
(mapCanonicalGlobals transform body)
CFalsum ->
CFalsum
CImp premise conclusion ->
CImp
(mapCanonicalGlobals transform premise)
(mapCanonicalGlobals transform conclusion)
CEq operandType left right ->
CEq operandType
(mapCanonicalGlobals transform left)
(mapCanonicalGlobals transform right)
CForall binderType body ->
CForall binderType
(mapCanonicalGlobals transform body)
-- | Recheck a nameless term without exposing the checked wrapper constructor.
checkCanonicalCore
:: (global -> Maybe CoreType)
-> CanonicalTerm global
-> Either CoreCheckError (FrozenCheckedCore global)
checkCanonicalCore globalType term =
FrozenCheckedCore
<$> inferCanonicalCore globalType [] term
<*> pure term
inferCanonicalCore
:: (global -> Maybe CoreType)
-> [CoreType]
-> CanonicalTerm global
-> Either CoreCheckError CoreType
inferCanonicalCore globalType binders = \case
CBound index ->
maybe
(Left (UnboundCoreIndex index))
Right
(binderTypeAt index binders)
CGlobal global ->
maybe
(Left UnknownCoreGlobal)
Right
(globalType global)
CIntrinsic intrinsic ->
Right (coreIntrinsicType intrinsic)
COpaqueInteger{} ->
Right TySet
CApp function argument -> do
functionType <-
inferCanonicalCore globalType binders function
argumentType <-
inferCanonicalCore globalType binders argument
case functionType of
TyArrow expectedArgument resultType
| expectedArgument == argumentType ->
Right resultType
| otherwise ->
Left
(ApplicationArgumentTypeMismatch
expectedArgument
argumentType)
other ->
Left (AppliedNonFunction other)
CLam binderType body -> do
bodyType <-
inferCanonicalCore
globalType
(binderType : binders)
body
Right (binderType `TyArrow` bodyType)
CFalsum ->
Right TyProp
CImp premise conclusion -> do
premiseType <-
inferCanonicalCore globalType binders premise
unless
(premiseType == TyProp)
(Left
(ImplicationOperandTypeMismatch
premiseType))
conclusionType <-
inferCanonicalCore globalType binders conclusion
unless
(conclusionType == TyProp)
(Left
(ImplicationOperandTypeMismatch
conclusionType))
Right TyProp
CEq operandType left right -> do
leftType <-
inferCanonicalCore globalType binders left
unless
(leftType == operandType)
(Left
(EqualityOperandTypeMismatch
operandType
leftType))
rightType <-
inferCanonicalCore globalType binders right
unless
(rightType == operandType)
(Left
(EqualityOperandTypeMismatch
operandType
rightType))
Right TyProp
CForall binderType body -> do
bodyType <-
inferCanonicalCore
globalType
(binderType : binders)
body
unless
(bodyType == TyProp)
(Left
(QuantifierBodyTypeMismatch bodyType))
Right TyProp
binderTypeAt :: Natural -> [CoreType] -> Maybe CoreType
binderTypeAt _index [] =
Nothing
binderTypeAt 0 (binderType : _rest) =
Just binderType
binderTypeAt index (_binderType : rest) =
binderTypeAt (index - 1) rest
shiftCanonical
:: Natural
-> Natural
-> CanonicalTerm global
-> CanonicalTerm global
shiftCanonical amount cutoff = \case
CBound index
| index >= cutoff ->
CBound (index + amount)
| otherwise ->
CBound index
CGlobal global ->
CGlobal global
CIntrinsic intrinsic ->
CIntrinsic intrinsic
COpaqueInteger integer ->
COpaqueInteger integer
CApp function argument ->
CApp
(shiftCanonical amount cutoff function)
(shiftCanonical amount cutoff argument)
CLam binderType body ->
CLam binderType
(shiftCanonical amount (cutoff + 1) body)
CFalsum ->
CFalsum
CImp premise conclusion ->
CImp
(shiftCanonical amount cutoff premise)
(shiftCanonical amount cutoff conclusion)
CEq operandType left right ->
CEq operandType
(shiftCanonical amount cutoff left)
(shiftCanonical amount cutoff right)
CForall binderType body ->
CForall binderType
(shiftCanonical amount (cutoff + 1) body)
data FreezeError
= FreeLocalInClosedCore
deriving stock (Show, Eq)
-- | Freeze a checked closed term in one traversal of the operational syntax.
freezeClosed
:: CheckedCore global Void
-> Either FreezeError (FrozenCheckedCore global)
freezeClosed (CheckedCore coreType syntax) =
FrozenCheckedCore coreType
<$> optimizedFreeze 0 rootResolver syntax
where
rootResolver _depth =
absurd
-- | Bounded executable oracle for tests. Production code uses 'freezeClosed'.
referenceFreezeClosed
:: CheckedCore global Void
-> Either FreezeError (FrozenCheckedCore global)
referenceFreezeClosed (CheckedCore coreType syntax) =
FrozenCheckedCore coreType
<$> referenceFreeze 0 rootResolver syntax
where
rootResolver _depth =
absurd
type VariableResolver local global =
Natural
-> local
-> Either FreezeError (CanonicalTerm global)
optimizedFreeze
:: Natural
-> VariableResolver local global
-> CoreSyntax global local
-> Either FreezeError (CanonicalTerm global)
optimizedFreeze depth resolve = \case
CoreLocal local ->
resolve depth local
CoreGlobal global ->
Right (CGlobal global)
CoreIntrinsic intrinsic ->
Right (CIntrinsic intrinsic)
CoreOpaqueInteger integer ->
Right (COpaqueInteger integer)
CoreApply function argument ->
CApp
<$> optimizedFreeze depth resolve function
<*> optimizedFreeze depth resolve argument
CoreLambda binderType body ->
CLam binderType
<$> optimizedFreeze
(depth + 1)
(resolveGeneralized depth resolve)
(unscope body)
CoreFalsum ->
Right CFalsum
CoreImplication premise conclusion ->
CImp
<$> optimizedFreeze depth resolve premise
<*> optimizedFreeze depth resolve conclusion
CoreEquality operandType left right ->
CEq operandType
<$> optimizedFreeze depth resolve left
<*> optimizedFreeze depth resolve right
CoreForall binderType body ->
CForall binderType
<$> optimizedFreeze
(depth + 1)
(resolveGeneralized depth resolve)
(unscope body)
where
resolveGeneralized
:: Natural
-> VariableResolver local global
-> VariableResolver
(Var () (CoreSyntax global local))
global
resolveGeneralized binderLevel outerResolve currentDepth = \case
B () ->
Right
(CBound
(currentDepth - binderLevel - 1))
F outerSyntax ->
optimizedFreeze
currentDepth
outerResolve
outerSyntax
referenceFreeze
:: Natural
-> VariableResolver local global
-> CoreSyntax global local
-> Either FreezeError (CanonicalTerm global)
referenceFreeze depth resolve = \case
CoreLocal local ->
resolve depth local
CoreGlobal global ->
Right (CGlobal global)
CoreIntrinsic intrinsic ->
Right (CIntrinsic intrinsic)
CoreOpaqueInteger integer ->
Right (COpaqueInteger integer)
CoreApply function argument ->
CApp
<$> referenceFreeze depth resolve function
<*> referenceFreeze depth resolve argument
CoreLambda binderType body ->
CLam binderType
<$> referenceFreeze
(depth + 1)
(resolveNormalized depth resolve)
(fromScope body)
CoreFalsum ->
Right CFalsum
CoreImplication premise conclusion ->
CImp
<$> referenceFreeze depth resolve premise
<*> referenceFreeze depth resolve conclusion
CoreEquality operandType left right ->
CEq operandType
<$> referenceFreeze depth resolve left
<*> referenceFreeze depth resolve right
CoreForall binderType body ->
CForall binderType
<$> referenceFreeze
(depth + 1)
(resolveNormalized depth resolve)
(fromScope body)
where
resolveNormalized
:: Natural
-> VariableResolver local global
-> VariableResolver (Var () local) global
resolveNormalized binderLevel outerResolve currentDepth = \case
B () ->
Right
(CBound
(currentDepth - binderLevel - 1))
F outerLocal ->
outerResolve currentDepth outerLocal
|