blob: 840e23ed6927e802901a1a16a917ce16f4e51031 (
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
|
(************************************************************************)
(* * The Coq Proof Assistant / The Coq Development Team *)
(* v * INRIA, CNRS and contributors - Copyright 1999-2018 *)
(* <O___,, * (see CREDITS file for the list of authors) *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(* * (see LICENSE file for the text of the license) *)
(************************************************************************)
open Names
open Constr
open Declarations
open Environ
open Entries
(** Inductive type checking and errors *)
(** The different kinds of errors that may result of a malformed inductive
definition. *)
(** Errors related to inductive constructions *)
type inductive_error =
| NonPos of env * constr * constr
| NotEnoughArgs of env * constr * constr
| NotConstructor of env * Id.t * constr * constr * int * int
| NonPar of env * constr * int * constr * constr
| SameNamesTypes of Id.t
| SameNamesConstructors of Id.t
| SameNamesOverlap of Id.t list
| NotAnArity of env * constr
| BadEntry
| LargeNonPropInductiveNotInType
exception InductiveError of inductive_error
val infos_and_sort : env -> constr -> Univ.Universe.t
val check_subtyping_arity_constructor : env -> (constr -> constr) -> types -> int -> bool -> unit
val check_positivity : chkpos:bool ->
Names.MutInd.t ->
Environ.env ->
(Constr.constr, Constr.types) Context.Rel.pt ->
Declarations.recursivity_kind ->
('a * Names.Id.t list * Constr.types array *
(('b, 'c) Context.Rel.pt * 'd))
array -> Int.t * Declarations.recarg Rtree.t array
(** The following function does checks on inductive declarations. *)
val check_inductive : env -> MutInd.t -> mutual_inductive_entry -> mutual_inductive_body
|
