let s' = dummies_of_coercions s in
let t' = dummies_of_coercions t in
Cic.Prod (n,s',t')
- | Cic.LetIn(n,s,t) ->
+ | Cic.LetIn(n,s,ty,t) ->
let s' = dummies_of_coercions s in
+ let ty' = dummies_of_coercions ty in
let t' = dummies_of_coercions t in
- Cic.LetIn (n,s',t')
+ Cic.LetIn (n,s',ty',t')
| Cic.MutCase _ -> Cic.Meta (-1,[])
| t -> t
;;
[head true ty; head true (unfold context ty)]
with ProofEngineTypes.Fail _ -> [head true ty]
-let key term = head false term
+let key term = head false term;;
let index_term_and_unfolded_term univ context t ty =
let key = head true ty in
let remove_uri univ uri =
let term = CicUtil.term_of_uri uri in
- let ty,_ = CicTypeChecker.type_of_aux' [] [] term CicUniv.empty_ugraph in
+ let ty,_ = CicTypeChecker.type_of_aux' [] [] term CicUniv.oblivion_ugraph in
remove univ [] term ty