@@ -380,13 +380,13 @@ let primitive_type_axioms : env -> lident -> string -> term -> list decl =
380
380
| Some ( _ , f ) -> f env s tt )
381
381
382
382
let encode_smt_lemma env fv t =
383
- let lid = fv . fv_name . v in
383
+ let lid = fv . fv_name in
384
384
let form , decls = encode_function_type_as_formula t env in
385
385
decls @([ Util. mkAssume ( form , Some ( " Lemma: " ^ ( string_of_lid lid )), ( " lemma_" ^( string_of_lid lid )))]
386
386
|> mk_decls_trivial )
387
387
388
388
let encode_free_var uninterpreted env fv tt t_norm quals : decls_t & env_t =
389
- let lid = fv . fv_name . v in
389
+ let lid = fv . fv_name in
390
390
if not <| ( U. is_pure_or_ghost_function t_norm || is_smt_reifiable_function env . tcenv t_norm )
391
391
|| U. is_lemma t_norm
392
392
|| uninterpreted
@@ -560,11 +560,11 @@ let encode_free_var uninterpreted env fv tt t_norm quals :decls_t & env_t =
560
560
561
561
562
562
let declare_top_level_let env x t t_norm : fvar_binding & decls_t & env_t =
563
- match lookup_fvar_binding env x . fv_name . v with
563
+ match lookup_fvar_binding env x . fv_name with
564
564
(* Need to introduce a new name decl *)
565
565
| None ->
566
566
let decls , env = encode_free_var false env x t t_norm [] in
567
- let fvb = lookup_lid env x . fv_name . v in
567
+ let fvb = lookup_lid env x . fv_name in
568
568
fvb , decls , env
569
569
570
570
(* already declared, only need an equation *)
@@ -1267,7 +1267,7 @@ let encode_datacon (env:env_t) (se:sigelt)
1267
1267
data_arg_params
1268
1268
arg_params
1269
1269
in
1270
- let ty = maybe_curry_fvb fv . fv_name . p encoded_head_fvb arg_vars in
1270
+ let ty = maybe_curry_fvb (pos fv . fv_name ) encoded_head_fvb arg_vars in
1271
1271
let xvars = List. map mkFreeV vars in
1272
1272
let dapp = mkApp ( ddconstrsym , xvars ) in //arity ok; |xvars| = |formals| = arity
1273
1273
let ty_pred = mk_HasTypeWithFuel ( Some s_fuel_tm ) dapp ty in
@@ -1632,7 +1632,7 @@ and encode_sigelt' (env:env_t) (se:sigelt) : (decls_t & env_t) =
1632
1632
|| se . sigattrs |> BU. for_some is_opaque_to_smt ->
1633
1633
let attrs = se . sigattrs in
1634
1634
let env , decls = BU. fold_map ( fun env lb ->
1635
- let lid = ( Inr ?. v lb . lbname ). fv_name . v in
1635
+ let lid = ( Inr ?. v lb . lbname ). fv_name in
1636
1636
if None ? <| Env. try_lookup_val_decl env . tcenv lid
1637
1637
then let val_decl = { se with sigel = Sig_declare_typ { lid ; us = lb . lbunivs ; t = lb . lbtyp };
1638
1638
sigquals = S. Irreducible :: se . sigquals } in
@@ -1643,12 +1643,12 @@ and encode_sigelt' (env:env_t) (se:sigelt) : (decls_t & env_t) =
1643
1643
1644
1644
(* Special encoding for b2t *)
1645
1645
| Sig_let { lbs =( _ , [{ lbname = Inr b2t }])} when S. fv_eq_lid b2t Const. b2t_lid ->
1646
- let tname , ttok , env = new_term_constant_and_tok_from_lid env b2t . fv_name . v 1 in
1646
+ let tname , ttok , env = new_term_constant_and_tok_from_lid env b2t . fv_name 1 in
1647
1647
let xx = mk_fv ( " x" , Term_sort ) in
1648
1648
let x = mkFreeV xx in
1649
1649
let b2t_x = mkApp ( " Prims.b2t" , [ x ]) in
1650
1650
let valid_b2t_x = mkApp ( " Valid" , [ b2t_x ]) in //NS: Explicitly avoid the Vaild(b2t t) inlining
1651
- let bool_ty = lookup_free_var env ( withsort Const. bool_lid ) in
1651
+ let bool_ty = lookup_free_var env Const. bool_lid in
1652
1652
let decls = [ Term. DeclFun ( tname , [ Term_sort ], Term_sort , None );
1653
1653
Util. mkAssume ( mkForall ( S. range_of_fv b2t ) ([[ b2t_x ]], [ xx ],
1654
1654
mkEq ( valid_b2t_x , mkApp ( snd boxBoolFun , [ x ]))),
@@ -1682,7 +1682,7 @@ and encode_sigelt' (env:env_t) (se:sigelt) : (decls_t & env_t) =
1682
1682
//Projectors are also are encoded directly via (our encoding of) theory of datatypes
1683
1683
//Except in some cases where the front-end does not emit a declare_typ for some projector, because it doesn't know how to compute it
1684
1684
let fv = Inr ?. v lb . lbname in
1685
- let l = fv . fv_name . v in
1685
+ let l = fv . fv_name in
1686
1686
begin match try_lookup_free_var env l with
1687
1687
| Some _ ->
1688
1688
[], env //already encoded
0 commit comments