(************************************************************************) (* * The Rocq Prover / The Rocq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* \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 Environ open EConstr open Glob_term open Termops open Mod_subst open Evd open Ltac_pretype
type _ delay =
| Now : 'a delay
| Later : [ `thunk ] delay
(** Should we keep details of universes during detyping ? *) val print_universes : boolref
(** If true, prints full local context of evars *) val print_evar_arguments : boolref
(** If true, contract branches with same r.h.s. and same matching
variables in a disjunctive pattern *) val print_factorize_match_patterns : unit -> bool
(** If this flag is true and the last non unique clause of a "match" is a
variable-free disjunctive pattern, turn it into a catch-call case *) val print_allow_match_default_clause : unit -> bool val print_allow_match_default_opt_name : stringlist
val subst_cases_pattern : substitution -> cases_pattern -> cases_pattern
val subst_glob_constr : env -> substitution -> glob_constr -> glob_constr
val factorize_eqns : 'a cases_clauses_g -> 'a disjunctive_cases_clauses_g
(** [detype isgoal avoid ctx c] turns a closed [c], into a glob_constr de Bruijn indexes are turned to bound names, avoiding names in [avoid] [isgoal] tells if naming must avoid global-level synonyms as intro does
[ctx] gives the names of the free variables *)
val detype : 'a delay -> ?isgoal:bool -> ?avoid:'g Namegen.Generator.input -> env -> evar_map -> constr -> 'a glob_constr_g
val detype_sort : evar_map -> Sorts.t -> glob_sort
val detype_rel_context : 'a delay -> constr option -> ?avoid:'g Namegen.Generator.input -> (names_context * env) ->
evar_map -> rel_context -> 'a glob_decl_g list
val share_pattern_names :
('g Namegen.Generator.input -> names_context -> 'c -> 'd Pattern.constr_pattern_r -> 'a) -> int ->
(Name.t * 'e option * binding_kind * 'b option * 'a) list -> 'g Namegen.Generator.input -> names_context -> 'c -> 'd Pattern.constr_pattern_r -> 'd Pattern.constr_pattern_r ->
(Name.t * 'e option * binding_kind * 'b option * 'a) list * 'a * 'a
(** look for the index of a named var or a nondep var as it is renamed *) val lookup_name_as_displayed : env -> evar_map -> constr -> Id.t -> int option val lookup_index_as_renamed : env -> evar_map -> constr -> int -> int option
val force_wildcard : unit -> bool val synthetize_type : unit -> bool
module PrintingInductiveMake :
functor (_ : sig val encode : Environ.env -> Libnames.qualid -> Names.inductive val member_message : Pp.t -> bool -> Pp.t val field : string val title : string end) -> Goptions.RefConvertArg withtype t = inductive and module Set = Indset
¤ Dauer der Verarbeitung: 0.22 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
