fact stringlengths 7 3.87k | type stringclasses 24 values | library stringclasses 13 values | imports listlengths 0 72 | filename stringclasses 416 values | symbolic_name stringlengths 1 67 | docstring stringclasses 596 values |
|---|---|---|---|---|---|---|
transportD2 {A : Type} (B : A -> Type) (B' : A -> Type) (C : forall a:A, B a -> B' a -> Type)
{x1 x2 : A} (p : x1 = x2) (y : B x1) (y' : B' x1) (z : C x1 y y')
: C x2 (p # y) (p # y')
:=
match p with eq_refl => z end. | Definition | test-suite | [] | test-suite/hott_example.v | transportD2 | null |
transportD3 {A : Type} (B : A -> Type) (B' : A -> Type) B''
(C : forall (a:A) (x: B a) (y: B' a), B'' a x y -> Type)
{x1 x2 : A} (p : x1 = x2) y y' y'' (z : C x1 y y' y'')
: C x2 (p # y) (p # y') (transportD2 _ _ _ p _ _ y'')
:=
match p with eq_refl => z end. | Definition | test-suite | [] | test-suite/hott_example.v | transportD3 | null |
transport_double A (P : A -> A -> Type) x y (e : x = y) (f : forall a, P a a) :
transport_eq (fun X => P X _ ) e (transport_eq (fun X => P _ X) e (f x)) = f y. | Definition | test-suite | [] | test-suite/hott_example.v | transport_double | null |
transport_forall A B (f : forall x : A , B x) y z (e : z = y) :
e # (f z) = f y. | Definition | test-suite | [] | test-suite/hott_example.v | transport_forall | null |
transport_forall2 (P:Type->Type) A A' B (f : P A -> P A') (y z : P A) (H : z = y)
(g : forall x , B A x -> B A' (f x))
(h : forall x , B A x) :
(transport_eq (B _) (ap _ H)
(g z (h z))) =
g y (h y). | Definition | test-suite | [] | test-suite/hott_example.v | transport_forall2 | null |
transport_pp {A : Type} (P : A -> Type) {x y z : A} (p : x = y) (q : y = z) (u : P x) :
p @ q # u = q # p # u :=
match q with eq_refl =>
match p with eq_refl => eq_refl end
end. | Definition | test-suite | [] | test-suite/hott_example.v | transport_pp | null |
inverse_left_inverse A (x y : A) (p : x = y) : eq_refl = (p ^ @ p). | Definition | test-suite | [] | test-suite/hott_example.v | inverse_left_inverse | null |
transport_pV {A : Type} (P : A -> Type) {x y : A} (p : x = y) (z : P y)
: p # p^ # z = z. | Definition | test-suite | [] | test-suite/hott_example.v | transport_pV | null |
transport_Vp {A : Type} (P : A -> Type) {x y : A} (p : y = x) (z : P y)
: p^ # p # z = z. | Definition | test-suite | [] | test-suite/hott_example.v | transport_Vp | null |
ap_V {A B : Type} (f : A -> B) {x y : A} (p : x = y) :
ap f (p^) = (ap f p)^. | Definition | test-suite | [] | test-suite/hott_example.v | ap_V | null |
concat_refl A (x y :A) (e: x = y) : e @ eq_refl = e. | Definition | test-suite | [] | test-suite/hott_example.v | concat_refl | null |
inv_inv A (x y :A) (e: x = y) : e^ @ e = eq_refl. | Definition | test-suite | [] | test-suite/hott_example.v | inv_inv | null |
transport_ap {A B : Type} (P : B -> Type) (f : A -> B) {x y : A}
(p : x = y) (z : P (f x)) : transport_eq P (ap f p) z =
transport_eq (fun x => P (f x)) p z. | Definition | test-suite | [] | test-suite/hott_example.v | transport_ap | null |
naturality {A B} `{P : A -> Type} `{Q : B -> Type}
(f : A -> B)
(e' : forall a, Q (f a) -> P a) a b (e : a = b)(z : Q (f a)):
e' _ (transport_eq (Q ∘ f) e z) = e # (e' _ z). | Definition | test-suite | [] | test-suite/hott_example.v | naturality | null |
concat_inv {A : Type} {x y z : A} (p : x = y) (q : y = z) :
(p @ q)^ = q^ @ p^. | Definition | test-suite | [] | test-suite/hott_example.v | concat_inv | null |
ap_inv {A B:Type} (f:A -> B) {x y:A} (p:x = y) : ap f p^ = (ap f p)^. | Definition | test-suite | [] | test-suite/hott_example.v | ap_inv | null |
transport_inv {A : Type} (P : A -> Type) {x y : A} (p : x = y) u v :
p # u = v -> u = transport_eq P p^ v. | Definition | test-suite | [] | test-suite/hott_example.v | transport_inv | null |
transport_commute A B (P : A -> B -> Type) x y (e : x = y) x' y' (e' : x' = y') u:
transport_eq (fun X => P X _ ) e (transport_eq (fun X => P _ X) e' u) =
transport_eq (fun X => P _ X ) e' (transport_eq (fun X => P X _) e u). | Definition | test-suite | [] | test-suite/hott_example.v | transport_commute | null |
transport_double' A B (P : A -> B -> Type) x y (e : x = y) g (f : forall a, P a (g a)) :
transport_eq (fun X => P X _ ) e (transport_eq (fun X => P _ (g X)) e (f x)) = f y. | Definition | test-suite | [] | test-suite/hott_example.v | transport_double | null |
path_sigma_uncurried {A : Type} (P : A -> Type) (u v : sigT P)
(pq : {p : u.1 = v.1 & u.2 = p^ # v.2})
: u = v. | Definition | test-suite | [] | test-suite/hott_example.v | path_sigma_uncurried | null |
pr1_path {A} `{P : A -> Type} {u v : sigT P} (p : u = v) : u.1 = v.1 := ap projT1 p. | Definition | test-suite | [] | test-suite/hott_example.v | pr1_path | null |
pr2_path {A} `{P : A -> Type} {u v : sigT P} (p : u = v)
: u.2 = p..1^ # v.2. | Definition | test-suite | [] | test-suite/hott_example.v | pr2_path | null |
path_prod_uncurried {A B : Type} (u v : A * B)
(pq : (fst u = fst v) * (snd u = snd v))
: u = v. | Definition | test-suite | [] | test-suite/hott_example.v | path_prod_uncurried | null |
ap_id A (x y:A) (e:x = y) : ap id e = e. | Definition | test-suite | [] | test-suite/hott_example.v | ap_id | null |
refl_V {A : Type} {x : A} (p : x = x) :
p^ = eq_refl -> p = eq_refl. | Definition | test-suite | [] | test-suite/hott_example.v | refl_V | null |
unpack_prod {A B} `{P : A * B -> Type} (u : A * B) :
P (fst u, snd u) -> P u. | Definition | test-suite | [] | test-suite/hott_example.v | unpack_prod | null |
pack_prod {A B} `{P : A * B -> Type} (u : A * B) :
P u -> P (fst u, snd u). | Definition | test-suite | [] | test-suite/hott_example.v | pack_prod | null |
transport_path_prod_uncurried {A B} (P : A * B -> Type) {x y : A * B}
(H : (fst x = fst y) * (snd x = snd y))
(Px : P x)
: transport_eq P (path_prod_uncurried _ _ H) Px
= unpack_prod _ (transport_eq (fun x => P (x, snd y))
(fst H)
(transport_eq (fun y => P (fst x, y))
(snd H)
(pack_prod _ Px))). | Lemma | test-suite | [] | test-suite/hott_example.v | transport_path_prod_uncurried | null |
path_prod_uncurried_inv {A B} {x y : A * B}
(H : (fst x = fst y) * (snd x = snd y))
: (path_prod_uncurried _ _ H)^
= path_prod_uncurried _ _ ((fst H)^, (snd H)^). | Lemma | test-suite | [] | test-suite/hott_example.v | path_prod_uncurried_inv | null |
transport_prod {A : Type} {P Q : A -> Type} {a a' : A} (p : a = a')
(z : P a * Q a)
: transport_eq (fun a => prod (P a) (Q a)) p z = (p # (fst z), p # (snd z)). | Definition | test-suite | [] | test-suite/hott_example.v | transport_prod | null |
transport_const {A B : Type} {x1 x2 : A} (p : x1 = x2) (y : B)
: transport_eq (fun x => B) p y = y. | Definition | test-suite | [] | test-suite/hott_example.v | transport_const | null |
transport_paths_l {A : Type} {x1 x2 y : A} (p : x1 = x2) (q : x1 = y)
: transport_eq (fun x => x = y) p q = p^ @ q. | Definition | test-suite | [] | test-suite/hott_example.v | transport_paths_l | null |
transport_paths_r {A : Type} {x y1 y2 : A} (p : y1 = y2) (q : x = y1)
: transport_eq (fun y => x = y) p q = q @ p. | Definition | test-suite | [] | test-suite/hott_example.v | transport_paths_r | null |
transport_paths_Fl {A B : Type} {f : A -> B} {x1 x2 : A} {y : B}
(p : x1 = x2) (q : f x1 = y)
: transport_eq (fun x => f x = y) p q = (ap f p)^ @ q. | Definition | test-suite | [] | test-suite/hott_example.v | transport_paths_Fl | null |
transport_paths_Fr {A B : Type} {g : A -> B} {y1 y2 : A} {x : B}
(p : y1 = y2) (q : x = g y1)
: transport_eq (fun y => x = g y) p q = q @ (ap g p). | Definition | test-suite | [] | test-suite/hott_example.v | transport_paths_Fr | null |
ap_pp {A B : Type} (f : A -> B) {x y z : A} (p : x = y) (q : y = z) :
ap f (p @ q) = (ap f p) @ (ap f q). | Definition | test-suite | [] | test-suite/hott_example.v | ap_pp | null |
concat_Ap {A B : Type} {f g : A -> B} (p : forall x, f x = g x) {x y : A} (q : x = y) :
(ap f q) @ (p y) = (p x) @ (ap g q). | Definition | test-suite | [] | test-suite/hott_example.v | concat_Ap | null |
concat_p_pp {A : Type} {x y z t : A} (p : x = y) (q : y = z) (r : z = t) :
p @ (q @ r) = (p @ q) @ r. | Definition | test-suite | [] | test-suite/hott_example.v | concat_p_pp | null |
ap_compose {A B C : Type} (f : A -> B) (g : B -> C) {x y : A} (p : x = y) :
ap (g ∘ f) p = ap g (ap f p). | Definition | test-suite | [] | test-suite/hott_example.v | ap_compose | null |
concat_pA1 {A : Type} {f : A -> A} (p : forall x, x = f x) {x y : A} (q : x = y) :
(p x) @ (ap f q) = q @ (p y). | Definition | test-suite | [] | test-suite/hott_example.v | concat_pA1 | null |
inv_inv' A (x y :A) (e: x = y) : e @ e^ = eq_refl. | Definition | test-suite | [] | test-suite/hott_example.v | inv_inv | null |
transport_switch {A : Type} (P : A -> Type) {x y : A} (p : y = x) (z : P y) z'
: z = p^ # z' -> p # z = z'. | Definition | test-suite | [] | test-suite/hott_example.v | transport_switch | null |
naturality' {A B} `{P : A -> Type} `{Q : B -> Type}
(f : A -> B)
(e' : forall a, P a -> Q (f a)) a b (e : a = b) z:
transport_eq (Q ∘ f) e (e' _ z) = e' _ (e # z). | Definition | test-suite | [] | test-suite/hott_example.v | naturality | null |
inv2 A (x y :A) (e: x = y) : e^ ^ = e. | Definition | test-suite | [] | test-suite/hott_example.v | inv2 | null |
IsEquiv {A : Type} {B : Type} (f : A -> B) := BuildIsEquiv {
e_inv : B -> A ;
e_sect : forall x, e_inv (f x) = x;
e_retr : forall y, f (e_inv y) = y;
e_adj : forall x : A, e_retr (f x) = ap f (e_sect x);
}. | Class | test-suite | [] | test-suite/hott_example.v | IsEquiv | null |
Equiv A B := BuildEquiv {
e_fun : A -> B ;
e_isequiv :: IsEquiv e_fun
}. | Class | test-suite | [] | test-suite/hott_example.v | Equiv | A class that includes all the data of an adjoint equivalence. |
univalent_transport {A B : Type} {e: A ≃ B} : A -> B := e_fun e. | Definition | test-suite | [] | test-suite/hott_example.v | univalent_transport | null |
e_inv' {A B : Type} (e : A ≃ B) : B -> A := e_inv (e_fun e). | Definition | test-suite | [] | test-suite/hott_example.v | e_inv | null |
e_sect' {A B : Type} (e : A ≃ B) := e_sect (e_fun e). | Definition | test-suite | [] | test-suite/hott_example.v | e_sect | null |
e_retr' {A B : Type} (e : A ≃ B) := e_retr (e_fun e). | Definition | test-suite | [] | test-suite/hott_example.v | e_retr | null |
e_adj' {A B : Type} (e : A ≃ B) := e_adj (e_fun e). | Definition | test-suite | [] | test-suite/hott_example.v | e_adj | null |
issect' {A B : Type} (f : A -> B) (g : B -> A)
(issect : g ∘ f == id) (isretr : f ∘ g == id) :=
fun x =>
ap g (ap f (issect x)^) @ ap g (isretr (f x)) @ issect x. | Definition | test-suite | [] | test-suite/hott_example.v | issect | null |
moveR_M1 {A : Type} {x y : A} (p q : x = y) :
eq_refl = p^ @ q -> p = q. | Definition | test-suite | [] | test-suite/hott_example.v | moveR_M1 | null |
concat_1p {A : Type} {x y : A} (p : x = y) :
eq_refl @ p = p := eq_refl. | Definition | test-suite | [] | test-suite/hott_example.v | concat_1p | null |
moveL_M1 {A : Type} {x y : A} (p q : x = y) :
eq_refl = q @ p^ -> p = q. | Definition | test-suite | [] | test-suite/hott_example.v | moveL_M1 | null |
moveL_M1' {A : Type} {x y : A} (p q : x = y) :
q^ @ p = eq_refl -> p = q. | Definition | test-suite | [] | test-suite/hott_example.v | moveL_M1 | null |
concat_A1p {A : Type} {f : A -> A} (p : forall x, f x = x) {x y : A} (q : x = y) :
(ap f q) @ (p y) = (p x) @ q. | Definition | test-suite | [] | test-suite/hott_example.v | concat_A1p | null |
moveL_Vp {A : Type} {x y z : A} (p : x = z) (q : y = z) (r : x = y) :
r @ q = p -> r = p @ q ^. | Definition | test-suite | [] | test-suite/hott_example.v | moveL_Vp | null |
is_adjoint' {A B : Type} (f : A -> B) (g : B -> A)
(issect : g∘ f == id) (isretr : f ∘ g == id) (a : A) :
isretr (f a) = ap f (issect' f g issect isretr a). | Definition | test-suite | [] | test-suite/hott_example.v | is_adjoint | null |
isequiv_adjointify {A B : Type} (f : A -> B) (g : B -> A)
(issect : g∘ f == id) (isretr : f ∘ g == id) : IsEquiv f
:= BuildIsEquiv A B f g (issect' f g issect isretr) isretr
(is_adjoint' f g issect isretr). | Definition | test-suite | [] | test-suite/hott_example.v | isequiv_adjointify | null |
nameAnon := {| binder_name := nAnon; binder_relevance := Relevant |}. | Notation | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | nameAnon | MWE du bug sur les niveaux d'univers frais. |
ind : term :=
tInd {| inductive_mind := (MPfile ["ind_fresh_univ";"TestSuite";"MetaRocq"], "Ind") ; inductive_ind := 0 |} []. | Definition | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | ind | MWE du bug sur les niveaux d'univers frais. |
AST_Ind := {|
ind_finite := Finite;
ind_npars := 1;
ind_params := [{|
decl_name := {| binder_name := nNamed "T"; binder_relevance := Relevant |};
decl_body := None;
decl_type := tSort (sType fresh_universe)
|}];
ind_bodies := [{|
ind_name := "Ind";
ind_indices := [];
ind_sort := sProp;
ind_type :=
tProd {| binder_name := nNamed "T"; binder_relevance := Relevant |}
(tSort (sType fresh_universe)) (tSort sProp);
ind_kelim := IntoPropSProp;
ind_ctors :=[];
ind_projs := [];
ind_relevance := Relevant
|}];
ind_universes := Monomorphic_ctx;
ind_variance := None
|}. | Definition | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | AST_Ind | MWE du bug sur les niveaux d'univers frais. |
AST_fun :=
tLambda
{| binder_name := nNamed "T"; binder_relevance := Relevant |}
(tSort (sType fresh_universe))
(tApp ind [tRel 0]). | Definition | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | AST_fun | MWE du bug sur les niveaux d'univers frais. |
define_ind : TemplateMonad unit :=
tmMkInductive true (mind_body_to_entry AST_Ind). | Definition | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | define_ind | null |
define_fun : TemplateMonad unit :=
tmMkDefinition "def" AST_fun. | Definition | test-suite | [
"MetaRocq.Utils",
"MetaRocq.Template",
"Checker",
"All",
"utils"
] | test-suite/ind_fresh_univ.v | define_fun | null |
qlist := Eval compute in match <% list %> with
| tInd ind _ => ind.(inductive_mind)
| _ => (MPfile nil, ""%bs)
end. | Definition | test-suite | [
"Stdlib",
"List",
"All",
"MetaRocq.Template"
] | test-suite/inferind.v | qlist | null |
refresh_sort t :=
match t with
| tSort s => tSort (Sort.map (fun _ => fresh_universe) s)
| _ => t
end. | Definition | test-suite | [
"Stdlib",
"List",
"All",
"MetaRocq.Template"
] | test-suite/inferind.v | refresh_sort | null |
refresh_arity s :=
let (ctx, concl) := decompose_prod_assum [] s in
it_mkProd_or_LetIn ctx (refresh_sort concl). | Definition | test-suite | [
"Stdlib",
"List",
"All",
"MetaRocq.Template"
] | test-suite/inferind.v | refresh_arity | null |
mind_body_to_entry :=
fun decl : mutual_inductive_body =>
{|
mind_entry_record := None;
mind_entry_finite := Finite;
mind_entry_params :=
match hd_error (ind_bodies decl) with
| Some i0 =>
List.rev
(let typ := decompose_prod (ind_type i0) in
let (a, b) := typ in
(fun p : list aname × list term =>
let (a0, b0) := p in
(fun (names : list aname) (types : list term) (_ : term) =>
let names0 := firstn (ind_npars decl) names in
let types0 := firstn (ind_npars decl) types in
map (fun '(x, ty) => vass x ty) (combine names0 types0)) a0 b0)
a b)
| None => []
end;
mind_entry_inds :=
map
(fun X : one_inductive_body =>
match X with
| {|
ind_name := ind_name;
ind_indices := ind_indices;
ind_sort := ind_sort;
ind_type := ind_type;
ind_kelim := ind_kelim;
ind_ctors := ind_ctors;
ind_projs := ind_projs;
ind_relevance := ind_relevance
|} =>
{|
mind_entry_typename := ind_name;
mind_entry_arity := refresh_arity (remove_arity (ind_npars decl) ind_type);
mind_entry_consnames :=
map (fun x : constructor_body => cstr_name x) ind_ctors;
mind_entry_lc :=
map
(fun x : constructor_body =>
remove_arity (ind_npars decl) (cstr_type x)) ind_ctors
|}
end) (ind_bodies decl);
mind_entry_universes := universes_entry_of_decl (ind_universes decl);
mind_entry_template := false;
mind_entry_variance := option_map (map Some) (ind_variance decl);
mind_entry_private := None
|}. | Definition | test-suite | [
"Stdlib",
"List",
"All",
"MetaRocq.Template"
] | test-suite/inferind.v | mind_body_to_entry | null |
bnamed n := {| binder_name := nNamed n; binder_relevance := Relevant |}. | Definition | test-suite | [
"Stdlib",
"List",
"Loader",
"MetaRocq.Template",
"All"
] | test-suite/inferindunivs.v | bnamed | null |
update_mutual_inductive_entry_inds (mie : mutual_inductive_entry) inds' :=
{| mind_entry_record := mie.(mind_entry_record);
mind_entry_finite := mie.(mind_entry_finite);
mind_entry_params := mie.(mind_entry_params);
mind_entry_inds := inds';
mind_entry_universes := mie.(mind_entry_universes);
mind_entry_template := mie.(mind_entry_template);
mind_entry_variance := mie.(mind_entry_variance);
mind_entry_private := mie.(mind_entry_private) |}. | Definition | test-suite | [
"Stdlib",
"List",
"Loader",
"MetaRocq.Template",
"All"
] | test-suite/inferindunivs.v | update_mutual_inductive_entry_inds | null |
add_cstr_univs (mie : mutual_inductive_entry) :=
let inds := mie.(mind_entry_inds) in
let add_cstr oie :=
let cstrs := oie.(mind_entry_lc) in
let cstr' :=
it_mkProd_or_LetIn mie.(mind_entry_params)
(tProd (bnamed "newty"%bs) qv
(tProd (bnamed "new") (mkApps rid [qu; tRel 0])
(mkApps (tRel (2 + List.length (mie.(mind_entry_params))))
(to_extended_list mie.(mind_entry_params)))))
in
let prime_cstrs := List.map (fun s => s ++ "'") oie.(mind_entry_consnames) in
{| mind_entry_typename := (oie.(mind_entry_typename) ++ "'");
mind_entry_arity := (*oie.(mind_entry_arity)*) qw;
mind_entry_lc := cstr' :: cstrs;
mind_entry_consnames := "newcons" :: prime_cstrs |}
in
let inds' := List.map add_cstr inds in
update_mutual_inductive_entry_inds mie inds'. | Definition | test-suite | [
"Stdlib",
"List",
"Loader",
"MetaRocq.Template",
"All"
] | test-suite/inferindunivs.v | add_cstr_univs | null |
foo : Set :=
| bar : foo. | Inductive | test-suite | [
"Stdlib",
"List",
"Loader",
"MetaRocq.Template",
"All"
] | test-suite/inferindunivs.v | foo | null |
fooref := (MPfile ["inferindunivs"; "TestSuite"; "MetaRocq"], "foo"). | Definition | test-suite | [
"Stdlib",
"List",
"Loader",
"MetaRocq.Template",
"All"
] | test-suite/inferindunivs.v | fooref | null |
n : Uint63.int := 42. | Definition | test-suite | [
"Template",
"Stdlib",
"Uint63",
"MetaRocq"
] | test-suite/int.v | n | null |
ns : list Uint63.int := [n]%list. | Definition | test-suite | [
"Template",
"Stdlib",
"Uint63",
"MetaRocq"
] | test-suite/int.v | ns | null |
ident_term (a : term) : term := a. | Definition | test-suite | [
"MetaRocq.Utils",
"All",
"utils",
"MetaRocq.Template"
] | test-suite/issue1042.v | ident_term | null |
quote_inductive {X}(inductive:X): TemplateMonad _ :=
quote <- tmQuote inductive;;
tmReturn quote. | Definition | test-suite | [
"MetaRocq.Utils",
"All",
"utils",
"MetaRocq.Template"
] | test-suite/issue1042.v | quote_inductive | null |
tm : Set := . | Inductive | test-suite | [
"MetaRocq.Utils",
"All",
"utils",
"MetaRocq.Template"
] | test-suite/issue1042.v | tm | null |
d1 : TemplateMonad unit. | Definition | test-suite | [
"MetaRocq.Utils",
"All",
"utils",
"MetaRocq.Template"
] | test-suite/issue1042.v | d1 | null |
test (X : Type) := test_T : test X -> test X. | Inductive | test-suite | [
"Template",
"List",
"Stdlib",
"MetaRocq"
] | test-suite/issue28.v | test | null |
tmLocateInd (q : qualid) : TemplateMonad kername :=
l <- tmLocate q ;;
match l with
| [] => tmFail ("Inductive [" ++ q ++ "] not found")
| (IndRef ind) :: _ => tmReturn ind.(inductive_mind)
| _ :: _ => tmFail ("[" ++ q ++ "] not an inductive")
end. | Definition | test-suite | [
"Template",
"List",
"Stdlib",
"MetaRocq"
] | test-suite/issue28.v | tmLocateInd | null |
nAnon := {| binder_name := nAnon; binder_relevance := Relevant |}. | Definition | test-suite | [
"Template",
"List",
"Stdlib",
"MetaRocq"
] | test-suite/issue28.v | nAnon | null |
nNamed s := {| binder_name := nNamed s; binder_relevance := Relevant |}. | Definition | test-suite | [
"Template",
"List",
"Stdlib",
"MetaRocq"
] | test-suite/issue28.v | nNamed | null |
T :=
tFix
[mkdef term (nNamed "f") (tProd (nNamed "x") (tApp (tInd (mkInd q_test 0) []) [tInd (mkInd q_unit 0) []]) (tInd (mkInd q_unit 0) []))
(tLambda (nNamed "x") (tApp (tInd (mkInd q_test 0) []) [tRel 0])
(tCase {|ci_ind := mkInd q_test 0; ci_npar := 1; ci_relevance := Relevant |}
{| pparams := [tInd (mkInd q_unit 0) []]; puinst := [];
pcontext := [nNamed "X"];
preturn := (tInd (mkInd q_unit 0) []) |}
(tRel 0)
[{| bcontext := [nNamed "x0"]; bbody := (tApp (tRel 2) [tRel 0]) |}]))
0] 0. | Definition | test-suite | [
"Template",
"List",
"Stdlib",
"MetaRocq"
] | test-suite/issue28.v | T | null |
a : nat. | Parameter | test-suite | [
"Loader",
"ssreflect",
"All",
"MetaRocq.Template"
] | test-suite/issue453.v | a | null |
aa : a = a + a. | Axiom | test-suite | [
"Loader",
"ssreflect",
"All",
"MetaRocq.Template"
] | test-suite/issue453.v | aa | null |
test := (let x := 2 in x). | Notation | test-suite | [
"Template",
"MetaRocq"
] | test-suite/letin.v | test | null |
x : nat. | Parameter | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | x | null |
b := forall X, X. | Definition | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | b | null |
c := Set. | Definition | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | c | null |
b := forall X, X. | Definition | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | b | null |
Class nat. | Existing | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | Class | null |
t : nat := 0. | Definition | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | t | null |
t' : nat. | Parameter | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | t | null |
t'' : nat. | Parameter | test-suite | [
"Template",
"MetaRocq",
"MetaRocq.Utils",
"MetaRocq.Template",
"utils",
"All"
] | test-suite/modules_sections.v | t | null |
tree :=
| leaf
| node : tree -> tree_list -> tree -> tree
with tree_list :=
| tdata : T -> tree_list
| tcons : tree -> tree_list -> tree_list. | Inductive | test-suite | [
"Template",
"MetaRocq"
] | test-suite/mutind.v | tree | null |
count_tree (t : tree) : nat :=
match t with
| leaf => 0
| node a b c => count_tree a + count_list b + count_tree c
end
with count_list (l : tree_list) : nat :=
match l with
| tdata _ => 1
| tcons t l => count_tree t + count_list l
end. | Fixpoint | test-suite | [
"Template",
"MetaRocq"
] | test-suite/mutind.v | count_tree | null |
foo : nat. | Definition | test-suite | [
"Stdlib",
"List",
"MetaRocq.Template",
"All",
"Nat"
] | test-suite/opaque.v | foo | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.