General: - [ ] HOL unification - [ ] HOL matching - [ ] SMTLIB2 parsing for lambdas and applications. Preprocessing: - [ ] CNF - [ ] Function definition elimination - [ ] Proxy axioms - [ ] Heuristic instantiations? Inferences: - [x] ArgCong - [x] BetaEtaISE - [x] BoolEqToDiseq - [x] BoolSimp - [x] Cases - [x] CasesSimp - [ ] Choice - [ ] LazyClausification - [ ] LazyClausificationGIE - [x] EagerClausificationISE - [x] IFFXORRewriterISE - [ ] ElimLeibniz - [x] FlexFlexSimplify - [ ] Injectivity - [x] NegativeExt - [x] PositiveExt - [x] PrimitiveInstantiation - [x] ImitateProject? Inferences that need adjusting: - [ ] Superposition - [ ] Demodulation - [ ] Subsumption - [x] Definition introduction Which inferences are incompatible with HOL? Proof checking for HOL? Issues: - [ ] Fix order of arguments for `app`, `arrowSort`, `lambda` calls and scrutinize every call site. - [ ] Consider replacing `EqHelper::replace` with `SubtermReplacer` that can shift DB indices if needed. - [ ] Make all binders compatible with HO matching (no loose DB indices can be bound).
General:
Preprocessing:
Inferences:
Inferences that need adjusting:
Which inferences are incompatible with HOL?
Proof checking for HOL?
Issues:
app,arrowSort,lambdacalls and scrutinize every call site.EqHelper::replacewithSubtermReplacerthat can shift DB indices if needed.