Open fdupress opened 5 months ago
By constructor lemmas, you mean injectivity/non-confusion?
No. I mean, given
inductive popo x =
| Foo of (P x).
The lemma that says forall x, P x => popo x.
In fact, inductive predicates are sent as abstract predicates to SMT solvers. Does not seem optimal to me.
The database for an inductive
indpred
would include theindpred_ind
principle, and the per-constructor lemmas, and could be used assmt(@indpred_smt)
(for example).This is to make rapid exploration possible when defining complex invariants as
inductive
predicates.