summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
7 daysDefine semantic interface identitiesadelon
7 daysDefine compact fact authorityadelon
7 daysClarify ambiguous syntax declaration guidanceadelon
7 daysReuse one parser per source moduleadelon
7 daysDefine syntax occurrence associationadelon
7 daysRemove obsolete lexicon pattern indexadelon
7 daysClarify source fixity pragma errorsadelon
7 daysDefer fixed-base conflicts to semantic ownershipadelon
7 daysBuild module-local syntax interfacesadelon
7 daysValidate every lexical parser surfaceadelon
7 daysOrder foundation manifest by stable tagsadelon
7 daysRetain exact source contentadelon
7 daysEstablish canonical syntax interfacesadelon
7 daysExtract source fixity pragmasadelon
7 daysSeparate epoch cache encodingadelon
7 daysValidate content-addressed mathematicsadelon
7 daysEstablish canonical identity codecsadelon
7 daysAccept empty source modulesadelon
7 daysFreeze content-addressed migration inventoryadelon
7 daysFreeze migration source routingadelon
7 daysCarry canonical roots through sourcesadelon
8 daysMerge branch 'main' of https://github.com/adelon/felixadelon
8 daysInformath sketchesadelon
9 daysClean libadelon
9 daysDocument connection search work unitsadelon
9 daysSimplify typed inductive fact preparationadelon
9 daysVerify TH0 with PATH Vampireadelon
9 daysFall back after reconstruction exhaustionadelon
9 daysBound deterministic Horn reconstructionadelon
9 daysRemove empty connection substitutionadelon
9 daysRemove obsolete kernel authorization projectionadelon
9 daysMove fact selection into transition inventoryadelon
9 daysBind typed fact admission to module buildersadelon
9 daysMeasure sequential verification workadelon
9 daysMeasure source and parser workadelon
9 daysAuthorize reconstructed Horn obligationsadelon
9 daysReplay bounded Horn connections in shadowadelon
9 daysPlan typed tasks from admitted factsadelon
9 daysAuthorize exact typed Vampire requestsadelon
9 daysRender checked prover problems as FOF or TH0adelon
9 daysClassify complete typed prover problemsadelon
9 daysCheck direct inductives through fixed-point replayadelon
9 daysPrepare direct inductive kernel proofsadelon
9 daysDefine bounded fixed-point kernel rulesadelon
9 daysAuthorize atomic facts through exact typed importsadelon
9 daysReplay scoped HOL derivations independentlyadelon
Replay rechecks stored terms against the current global signature and bounds nodes, lexical depth, and conversion. Import-bearing trees remain replay-only until exact transition-inventory authorization alignment lands.
9 daysCheck scoped canonical HOL termsadelon
9 daysAuthorize ground reflexivity through kernel replayadelon
The first typed fact family is deliberately dependency-free. Its rows remain outside the legacy fact registry, so unmigrated declarations cannot consume or reauthorize them.
9 daysReplay equality reflexivity independentlyadelon
9 daysRecheck frozen HOL terms canonicallyadelon