(************************************************************************)
(* * 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 Declarations
open Mod_subst
open Univ
(** Operations concerning types in [Declarations] :
[constant_body], [mutual_inductive_body], [module_body] ... *)
val universes_context : universes -> AUContext.t
val abstract_universes : Entries.universes_entry -> Univ.universe_level_subst * universes
(** {6 Arities} *)
val map_decl_arity : ('a -> 'c) -> ('b -> 'd) ->
('a, 'b) declaration_arity -> ('c, 'd) declaration_arity
(** {6 Constants} *)
val subst_const_body : substitution -> constant_body -> constant_body
(** Is there a actual body in const_body ? *)
val constant_has_body : constant_body -> bool
val constant_polymorphic_context : constant_body -> AUContext.t
(** Is the constant polymorphic? *)
val constant_is_polymorphic : constant_body -> bool
(** Return the universe context, in case the definition is polymorphic, otherwise
the context is empty. *)
val is_opaque : constant_body -> bool
(** {6 Inductive types} *)
val eq_recarg : recarg -> recarg -> bool
val subst_recarg : substitution -> recarg -> recarg
val mk_norec : wf_paths
val mk_paths : recarg -> wf_paths list array -> wf_paths
val dest_recarg : wf_paths -> recarg
val dest_subterms : wf_paths -> wf_paths list array
val recarg_length : wf_paths -> int -> int
val subst_wf_paths : substitution -> wf_paths -> wf_paths
val subst_mind_body : substitution -> mutual_inductive_body -> mutual_inductive_body
val inductive_polymorphic_context : mutual_inductive_body -> AUContext.t
(** Is the inductive polymorphic? *)
val inductive_is_polymorphic : mutual_inductive_body -> bool
(** Is the inductive cumulative? *)
val inductive_is_cumulative : mutual_inductive_body -> bool
val inductive_make_projection : Names.inductive -> mutual_inductive_body -> proj_arg:int ->
Names.Projection.Repr.t option
val inductive_make_projections : Names.inductive -> mutual_inductive_body ->
Names.Projection.Repr.t array option
val relevance_of_projection_repr : mutual_inductive_body -> Names.Projection.Repr.t -> Sorts.relevance
(** {6 Kernel flags} *)
(** A default, safe set of flags for kernel type-checking *)
val safe_flags : Conv_oracle.oracle -> typing_flags
(** {6 Hash-consing} *)
(** Here, strictly speaking, we don't perform true hash-consing
of the structure, but simply hash-cons all inner constr
and other known elements *)
val hcons_const_body : constant_body -> constant_body
val hcons_mind : mutual_inductive_body -> mutual_inductive_body
val hcons_module_body : module_body -> module_body
val hcons_module_type : module_type_body -> module_type_body
¤ Dauer der Verarbeitung: 0.18 Sekunden
(vorverarbeitet)
¤
|
schauen Sie vor die Tür
Fenster
Die Firma ist wie angegeben erreichbar.
Die farbliche Syntaxdarstellung ist noch experimentell.
|