blob: 51944a58f89fe52bbdd6418b5b93f0528fed8603 (
plain)
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
|
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE NoImplicitPrelude #-}
-- | Pure applicability checks for later trusted materialization.
--
-- Successful checks are inert. Fresh completion and validated loading or
-- sealing own the runtime authority that may publish a fact.
module Felix.Checking.Materialization
( CandidateValidation
, candidateProofValidation
, candidateDeclarationValidation
, checkDeclarationValidationRecord
, checkCandidateValidation
, checkImportedMembership
, checkImportedOccurrence
, MaterializationError(..)
) where
import Base
import Felix.Checking.Authority
import Felix.Checking.Identity
import Felix.Checking.Semantic
import Control.Monad (unless)
import Numeric.Natural (Natural)
data CandidateValidation
= CandidateProofValidation
!ProofValidationRecord
!ProofSyntaxId
| CandidateDeclarationValidation
!DeclarationValidationRecord
!DeclarationSyntaxId
![ObjectId]
![TheoremId]
!Natural
deriving stock (Show, Eq)
candidateProofValidation
:: ProofValidationRecord
-> ProofSyntaxId
-> CandidateValidation
candidateProofValidation =
CandidateProofValidation
candidateDeclarationValidation
:: DeclarationValidationRecord
-> DeclarationSyntaxId
-> [ObjectId]
-> [TheoremId]
-> Natural
-> CandidateValidation
candidateDeclarationValidation =
CandidateDeclarationValidation
checkDeclarationValidationRecord
:: PrefixContextId
-> DeclarationSyntaxId
-> [ObjectId]
-> [TheoremId]
-> DeclarationValidationRecord
-> Either MaterializationError ()
checkDeclarationValidationRecord prefix syntax objects theorems record = do
let suppliedKey =
declarationValidationRecordKey record
certificates =
declarationValidationRecordCertificates record
expectedKey =
declarationValidationKey
syntax prefix objects theorems
unless
(suppliedKey == expectedKey)
(Left
(DeclarationValidationKeyMismatch
suppliedKey expectedKey))
let certificateTheorems =
theoremId
. factAuthorityTheorem
. validationTarget
<$> certificates
unless
(certificateTheorems == theorems)
(Left
(DeclarationCertificateTargetsMismatch
theorems certificateTheorems))
data MaterializationError
= CandidateValidationIndexMissing !Natural
| ProofValidationKeyMismatch
!ProofValidationKey
!ProofValidationKey
| DeclarationValidationKeyMismatch
!DeclarationValidationKey
!DeclarationValidationKey
| DeclarationCertificateTargetsMismatch
![TheoremId]
![TheoremId]
| CandidateCertificateTargetMismatch
!FactAuthority
!FactAuthority
| CandidateDirectAuthorizationMismatch
!DirectAuthorization
!DirectAuthorization
| CandidateTheoryMismatch !TheoryId !TheoryId
| CandidatePropositionMismatch
!PropositionId
!PropositionId
| ImportedOccurrenceMissing
!SemanticFactOccurrenceFingerprint
| ImportedAuthorityMismatch
!FactAuthority
!FactAuthority
| ImportedTheoryMismatch !TheoryId !TheoryId
| ImportedPropositionMismatch
!PropositionId
!PropositionId
deriving stock (Show, Eq)
-- | Check whether inert validation data applies to one exact candidate.
--
-- Success deliberately returns no builder authorization. A fresh trusted
-- completion or compatible validated-store hit must perform this check before
-- its owner mints runtime authority.
checkCandidateValidation
:: TheoryId
-> PrefixContextId
-> CheckedPropositionContent
-> FactAuthority
-> DirectAuthorization
-> CandidateValidation
-> Either MaterializationError ()
checkCandidateValidation
theory prefix proposition expectedAuthority
expectedDirect validation = do
certificate <-
candidateCertificate
prefix expectedAuthority validation
validateCertificateTarget
theory proposition expectedAuthority expectedDirect certificate
candidateCertificate
:: PrefixContextId
-> FactAuthority
-> CandidateValidation
-> Either MaterializationError ValidationCertificate
candidateCertificate prefix authority = \case
CandidateProofValidation record syntax -> do
let suppliedKey =
proofValidationRecordKey record
certificate =
proofValidationRecordCertificate record
expectedKey =
proofValidationKey
(theoremId
(factAuthorityTheorem authority))
syntax
prefix
unless
(suppliedKey == expectedKey)
(Left
(ProofValidationKeyMismatch
suppliedKey expectedKey))
pure certificate
CandidateDeclarationValidation
record syntax objects theorems ordinal -> do
checkDeclarationValidationRecord
prefix syntax objects theorems record
maybe
(Left (CandidateValidationIndexMissing ordinal))
Right
(nthNatural ordinal
(declarationValidationRecordCertificates record))
validateCertificateTarget
:: TheoryId
-> CheckedPropositionContent
-> FactAuthority
-> DirectAuthorization
-> ValidationCertificate
-> Either MaterializationError ()
validateCertificateTarget
theory proposition expectedAuthority expectedDirect certificate = do
let actualAuthority =
validationTarget certificate
actualDirect =
validationDirectAuthorization certificate
reference =
factAuthorityTheorem actualAuthority
unless
(actualAuthority == expectedAuthority)
(Left
(CandidateCertificateTargetMismatch
expectedAuthority actualAuthority))
unless
(actualDirect == expectedDirect)
(Left
(CandidateDirectAuthorizationMismatch
expectedDirect actualDirect))
unless
(theoremRefTheory reference == theory)
(Left
(CandidateTheoryMismatch
theory
(theoremRefTheory reference)))
unless
( theoremRefProposition reference
== checkedPropositionId proposition
)
(Left
(CandidatePropositionMismatch
(checkedPropositionId proposition)
(theoremRefProposition reference)))
-- | Validate exact membership in inert canonical interface data.
--
-- Logical sealing or atomic cached installation must additionally supply the
-- opaque runtime evidence before an importer receives builder authority.
checkImportedMembership
:: TheoryId
-> SemanticInterface
-> SemanticFactOccurrenceFingerprint
-> CheckedPropositionContent
-> FactAuthority
-> Either MaterializationError SemanticFactOccurrence
checkImportedMembership
theory interface fingerprint proposition expectedAuthority = do
occurrence <-
maybe
(Left (ImportedOccurrenceMissing fingerprint))
Right
(find
((== fingerprint) . semanticFactFingerprint)
(concatMap
declarationDeltaFacts
(semanticInterfaceDeclarations interface)))
checkImportedOccurrence
theory fingerprint occurrence proposition expectedAuthority
checkImportedOccurrence
:: TheoryId
-> SemanticFactOccurrenceFingerprint
-> SemanticFactOccurrence
-> CheckedPropositionContent
-> FactAuthority
-> Either MaterializationError SemanticFactOccurrence
checkImportedOccurrence
theory fingerprint occurrence proposition expectedAuthority = do
unless
(semanticFactFingerprint occurrence == fingerprint)
(Left (ImportedOccurrenceMissing fingerprint))
let actualAuthority =
semanticFactAuthority occurrence
reference =
factAuthorityTheorem actualAuthority
unless
(actualAuthority == expectedAuthority)
(Left
(ImportedAuthorityMismatch
expectedAuthority actualAuthority))
unless
(theoremRefTheory reference == theory)
(Left
(ImportedTheoryMismatch
theory
(theoremRefTheory reference)))
unless
(theoremRefProposition reference
== checkedPropositionId proposition)
(Left
(ImportedPropositionMismatch
(checkedPropositionId proposition)
(theoremRefProposition reference)))
pure occurrence
nthNatural :: Natural -> [value] -> Maybe value
nthNatural ordinal =
go ordinal
where
go _ [] =
Nothing
go 0 (value : _) =
Just value
go remaining (_ : rest) =
go (remaining - 1) rest
|
