diff options
| author |  Matthieu Sozeau <mattam@mattam.org> | 2016-06-16 18:49:07 +0200 |
|---|---|---|
| committer | Matthieu Sozeau <mattam@mattam.org> | 2016-06-27 23:29:05 +0200 |
| commit | bd55e2b2787bbabf7fba126126611c58548424fc (patch) | |
| tree | c56d7ebcb1c1d240ae84dcd9bd411d3f0932a486 /kernel/term.mli | |
| parent | 727dcedd8d1d6be5c77cbf4bbe08ff18facf3ba2 (diff) | |
Shrink Proofs/Obligations by default and deprecate
Fix bug in Shrink obligations with Program in the process.
Fix implementation of shrink for abstract proofs
- Update doc in term.mli to reflect the fact that let-in's
are part of what is returned by [decompose_lam_assum].
Diffstat (limited to 'kernel/term.mli')
| -rw-r--r-- | kernel/term.mli | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/kernel/term.mli b/kernel/term.mli index 32267f6c4..60a3c7715 100644 --- a/kernel/term.mli +++ b/kernel/term.mli @@ -315,7 +315,7 @@ val decompose_lam_n : int -> constr -> (Name.t * constr) list * constr "(xi:Ti) ... (xj:=cj:Tj) ..., T" where T is not a product nor a let *) val decompose_prod_assum : types -> Context.Rel.t * types -(** Idem with lambda's *) +(** Idem with lambda's and let's *) val decompose_lam_assum : constr -> Context.Rel.t * constr (** Idem but extract the first [n] premisses, counting let-ins. *) |