blob: c784dd5dde0ffb2f89dea32c51e7083808f5c6d4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
open Names
open Pp
val mk_rel_id : identifier -> identifier
val msgnl : std_ppcmds -> unit
val invalid_argument : string -> 'a
val fresh_id : identifier list -> string -> identifier
val fresh_name : identifier list -> string -> name
val get_name : identifier list -> ?default:string -> name -> name
val array_get_start : 'a array -> 'a array
val id_of_name : name -> identifier
val locate_ind : Libnames.reference -> inductive
val locate_constant : Libnames.reference -> constant
val locate_with_msg :
Pp.std_ppcmds -> (Libnames.reference -> 'a) ->
Libnames.reference -> 'a
val filter_map : ('a -> bool) -> ('a -> 'b) -> 'a list -> 'b list
val list_union_eq :
('a -> 'a -> bool) -> 'a list -> 'a list -> 'a list
val list_add_set_eq :
('a -> 'a -> bool) -> 'a -> 'a list -> 'a list
val chop_rlambda_n : int -> Rawterm.rawconstr ->
(name*Rawterm.rawconstr) list * Rawterm.rawconstr
val chop_rprod_n : int -> Rawterm.rawconstr ->
(name*Rawterm.rawconstr) list * Rawterm.rawconstr
val def_of_const : Term.constr -> Term.constr
val eq : Term.constr Lazy.t
val refl_equal : Term.constr Lazy.t
val const_of_id: identifier -> constant
type elim_scheme = { (* lists are in reverse order! *)
params: Sign.rel_context; (* (prm1,tprm1);(prm2,tprm2)...(prmp,tprmp) *)
predicates: Sign.rel_context; (* (Qq, (Tq_1 -> Tq_2 ->...-> Tq_nq)), (Q1,...) *)
branches: Sign.rel_context; (* branchr,...,branch1 *)
args: Sign.rel_context; (* (xni, Ti_ni) ... (x1, Ti_1) *)
indarg: Term.rel_declaration option; (* Some (H,I prm1..prmp x1...xni) if present, None otherwise *)
concl: Term.types; (* Qi x1...xni HI, some prmis may not be present *)
indarg_in_concl:bool; (* true if HI appears at the end of conclusion (dependent scheme) *)
}
val compute_elim_sig : Term.types -> elim_scheme
|
