blob: f763e182bae16dbf169563e6872f9f7c1ab213fd (
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
54
55
56
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2010 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: indschemes.mli 13323 2010-07-24 15:57:30Z herbelin $ i*)
(*i*)
open Util
open Names
open Term
open Environ
open Libnames
open Rawterm
open Genarg
open Vernacexpr
open Ind_tables
(*i*)
(* See also Auto_ind_decl, Indrec, Eqscheme, Ind_tables, ... *)
(* Build and register the boolean equalities associated to an inductive type *)
val declare_beq_scheme : mutual_inductive -> unit
val declare_eq_decidability : mutual_inductive -> unit
(* Build and register a congruence scheme for an equality-like inductive type *)
val declare_congr_scheme : inductive -> unit
(* Build and register rewriting schemes for an equality-like inductive type *)
val declare_rewriting_schemes : inductive -> unit
(* Mutual Minimality/Induction scheme *)
val do_mutual_induction_scheme :
(identifier located * bool * inductive * rawsort) list -> unit
(* Main calls to interpret the Scheme command *)
val do_scheme : (identifier located option * scheme) list -> unit
(* Combine a list of schemes into a conjunction of them *)
val build_combined_scheme : env -> constant list -> constr * types
val do_combined_scheme : identifier located -> identifier located list -> unit
(* Hook called at each inductive type definition *)
val declare_default_schemes : mutual_inductive -> unit
|
