package coq

You can search for identifiers within the package.

in-package search v0.2.0

coq.clib
- Backtrace
- Bigint
- CArray
  - ExtS
    
    Floatarray
    
    Fun1
    
    Smart
    
    Smart
  - Floatarray
  - Fun1
    
    Smart
  - S
    
    Floatarray
  - Smart
- CEphemeron
- CList
  - ExtS
    
    MonoS
    
    Smart
  - MonoS
  - S
  - Smart
- CMap
  - ExtS
    
    Monad
    
    M
    
    Set
    
    Smart
    
    Unsafe
  - Make
    
    M
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - MonadS
  - OrderedType
- CObj
- CSet
  - Hashcons
    
    H
    
    M
  - HashedType
  - Make
    
    M
  - OrderedType
- CStack
- CString
  - ExtS
    
    List
    
    Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
    
    Set
  - List
  - Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - S
  - Set
- CThread
- CUnix
- Diff2
  - Make
    
    M
  - S
  - SeqType
- Dyn
  - Make
    
    Easy
    
    Map
    
    Value
  - MapS
  - S
    
    Easy
    
    Map
    
    Value
  - ValueS
- Exninfo
- HMap
  - HashedType
  - Make
    
    M
    
    Monad
    
    M
    
    Set
    
    Smart
    
    Unsafe
- Hashcons
  - HashconsedType
  - HashedType
  - Hlist
    
    D
  - Hstring
  - Make
    
    X
  - S
- Hashset
  - Combine
  - EqType
  - Make
    
    E
  - S
- Heap
  - Functional
    
    X
  - Ordered
  - S
- IStream
- Int
  - List
  - Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - PArray
  - PMap
  - Set
- Minisys
- Monad
  - Def
  - ListS
  - Make
    
    List
    
    M
  - S
    
    List
- Option
  - List
  - Smart
- OrderedType
  - Pair
    
    M
    
    N
  - S
  - UnorderedPair
    
    M
- Predicate
  - Make
    
    Ord
  - OrderedType
  - S
- Range
- Segmenttree
- Store
  - Make
  - S
- Terminal
- Trie
  - Grp
  - Make
    
    Data
    
    Label
  - S
- Unicode
- Unicodetable
- Unionfind
  - Make
    
    M
    
    S
  - MapS
  - PartitionSig
  - SetS
coq.engine
- EConstr
  - EInstance
  - ESorts
  - Unsafe
  - Vars
- Evar_kinds
- Evarutil
- Evd
  - Filter
  - Metamap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Metaset
  - MiniEConstr
    
    EInstance
    
    ESorts
  - Monad
    
    List
  - MonadR
    
    List
  - Store
- Ftactic
  - List
  - Notations
- Logic_monad
  - BackState
  - Logical
    
    List
    
    P
    
    Unsafe
  - NonLogical
    
    List
  - Param
- Namegen
- Nameops
  - Name
- Proofview
  - Goal
  - Monad
    
    List
  - NonLogical
    
    List
  - Notations
  - Trace
  - Unsafe
  - UnsafeRepr
  - V82
- Proofview_monad
  - Comb
  - Env
  - Giveup
  - Info
  - InfoL
  - Logical
    
    List
    
    Unsafe
  - P
  - Pv
  - Shelf
  - Solution
  - State
  - StateStore
  - Status
  - Trace
  - Writer
- Termops
  - Internal
- UState
- UnivGen
- UnivMinim
  - UPairSet
- UnivNames
- UnivProblem
  - Set
- UnivSubst
- Universes
- Univops
coq.grammar
- Q_util
coq.interp
- Constrexpr
- Constrexpr_ops
- Constrextern
- Constrintern
- Declare
- Discharge
- Dumpglob
- Genintern
  - Store
- Genredexpr
- Impargs
- Implicit_quantifiers
- Modintern
- Notation
  - NotationMap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - NotationSet
- Notation_ops
- Notation_term
- Redops
- Reserve
- Smartlocate
- Stdarg
- Syntax_def
- Tactypes
coq.kernel
- CClosure
  - RedFlags
  - RedFlagsSig
- CPrimitives
- Cbytecodes
  - FvMap
  - Label
- Cbytegen
- Cemitcodes
- Clambda
- Constr
- Context
  - Compacted
    
    Declaration
  - Named
    
    Declaration
  - Rel
    
    Declaration
- Conv_oracle
- Cooking
- Copcodes
- Csymtable
- Declarations
- Declareops
- Entries
- Environ
- Esubst
- Evar
  - Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Set
- Indtypes
- Inductive
- Mod_subst
- Mod_typing
- Modops
- Names
  - Cmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Cmap_env
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Constant
    
    CanOrd
    
    SyntacticOrd
    
    UserOrd
  - Constrmap
  - Constrmap_env
  - Cpred
  - Cset
  - Cset_env
  - DirPath
  - GlobRef
  - Id
    
    List
    
    Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
    
    Pred
    
    Set
  - Indmap
  - Indmap_env
  - KNmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - KNpred
  - KNset
  - KerName
  - Label
    
    Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
    
    Set
  - MBId
  - MBImap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - MBIset
  - MPmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - MPset
  - Mindmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Mindmap_env
  - Mindset
  - ModIdmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - ModIdset
  - ModPath
  - MutInd
    
    CanOrd
    
    SyntacticOrd
    
    UserOrd
  - Name
  - Projection
    
    CanOrd
    
    Repr
    
    CanOrd
    
    SyntacticOrd
    
    UserOrd
    
    SyntacticOrd
- Nativecode
- Nativeconv
- Nativelambda
- Nativelib
- Nativelibrary
- Nativevalues
- Opaqueproof
- Reduction
- Retroknowledge
- Safe_typing
- Sorts
  - List
- Subtyping
- Term
- Term_typing
- Type_errors
- Typeops
- UGraph
- Uint31
- Univ
  - ACumulativityInfo
  - AUContext
  - Constraint
  - ContextSet
  - CumulativityInfo
  - Instance
  - LMap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - LSet
  - Level
  - UContext
  - Universe
  - Variance
- Vars
- Vconv
- Vm
- Vmvalues
coq.lib
- Aux_file
  - H
  - M
- CAst
- CErrors
- CProfile
- CWarnings
- Control
- CoqProject_file
- Coq_config
- DAst
- Envars
- Explore
  - Make
    
    S
  - SearchProblem
- Feedback
- Flags
- Future
  - UUID
  - UUIDMap
  - UUIDSet
- Genarg
  - ArgT
  - GenObj
  - Register
    
    M
- Hook
- Loc
- Pp
- Pp_diff
  - StringDiff
- RemoteCounter
- Rtree
  - Smart
- Spawn
  - Async
    
    ML
  - Control
  - MainLoopModel
  - Sync
- Stateid
  - Self
  - Set
- System
- Util
  - Array
    
    Floatarray
    
    Fun1
    
    Smart
    
    Smart
  - Empty
  - List
    
    MonoS
    
    Smart
  - Map
    
    ExtS
    
    Monad
    
    M
    
    Set
    
    Smart
    
    Unsafe
    
    Make
    
    M
    
    Monad
    
    M
    
    Smart
    
    Unsafe
    
    MonadS
    
    OrderedType
  - Set
    
    Hashcons
    
    H
    
    M
    
    HashedType
    
    Make
    
    M
    
    OrderedType
  - Stack
  - String
    
    List
    
    Map
    
    Monad
    
    M
    
    Smart
    
    Unsafe
    
    Set
  - Union
coq.library
- Coqlib
- Decl_kinds
- Declaremods
- Decls
- Dischargedhypsmap
- Global
- Globnames
  - ExtRefOrdered
  - RefOrdered
  - RefOrdered_env
  - Refmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Refmap_env
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Refset
  - Refset_env
- Goptions
  - MakeRefTable
    
    A
  - MakeStringTable
    
    A
  - OptionMap
- Keys
- Kindops
- Lib
- Libnames
  - Dirmap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - Dirset
  - Spmap
- Libobject
- Library
- Loadpath
- Nametab
  - EqualityType
  - Make
    
    E
    
    U
  - NAMETREE
  - UnivIdMap
    
    Monad
    
    M
    
    Set
    
    Smart
    
    Unsafe
  - UserName
- States
- Summary
  - Dyn
    
    Easy
    
    Map
    
    Value
  - Local
coq.parsing
- CLexer
  - Error
- Extend
- G_constr
- G_prim
- Notation_gram
- Notgram_ops
- Pcoq
  - Constr
  - Entry
  - Gram
    
    Entry
    
    Unsafe
  - GramState
  - Module
  - Parsable
  - Prim
- Ppextend
- Tok
coq.pretyping
- Arguments_renaming
- Cases
- Cbv
- Classops
- Coercion
- Constr_matching
- Detyping
  - PrintingInductiveMake
    
    Test
- Evarconv
- Evardefine
- Evarsolve
- Find_subterm
- Geninterp
  - TacStore
  - Val
  - ValTMap
    
    Value
- Glob_ops
- Glob_term
- Heads
- Indrec
- Inductiveops
- InferCumulativity
- Locus
- Locusops
- Ltac_pretype
- Nativenorm
- Pattern
- Patternops
- Pretype_errors
- Pretyping
- Program
- Recordops
- Reductionops
- Retyping
- Tacred
- Typeclasses
- Typeclasses_errors
- Typing
- Unification
- Vnorm
coq.printing
- Genprint
- Ppconstr
- Pputils
- Prettyp
- Printer
  - ContextObjectMap
    
    Monad
    
    M
    
    Smart
    
    Unsafe
  - ContextObjectSet
- Printmod
- Proof_diffs
  - StringMap
coq.proofs
- Clenv
- Clenvtac
- Evar_refiner
- Goal
  - Set
  - V82
- Goal_select
- Logic
- Miscprint
- Pfedit
- Proof
  - V82
- Proof_bullet
- Proof_global
  - V82
- Proof_type
- Redexpr
- Refine
- Refiner
- Tacmach
  - New
coq.stm
- AsyncTaskQueue
  - MakeQueue
    
    T
  - MakeWorker
    
    T
  - Task
- CoqworkmgrApi
- Dag
  - Make
    
    NodeSet
    
    OT
    
    Property
  - S
    
    NodeSet
    
    Property
- ProofBlockDelimiter
- Spawned
- Stm
  - AsyncOpts
  - DynBlockData
    
    Easy
    
    Map
    
    Value
  - ProofTask
  - QueryTask
  - TacTask
- TQueue
- Vcs
  - Make
    
    Branch
    
    Dag
    
    NodeSet
    
    Property
    
    OT
  - S
    
    Branch
    
    Dag
    
    NodeSet
    
    Property
- Vernac_classifier
- Vio_checking
- WorkerPool
  - Make
    
    Model
  - PoolModel
coq.tactics
- Auto
- Autorewrite
- Btermdn
  - Make
    
    Z
- Class_tactics
  - Search
- Contradiction
- Dn
  - Make
    
    Y
    
    Z
- Dnet
  - Datatype
  - Make
    
    Ident
    
    Idset
    
    Meta
    
    T
  - S
    
    Idset
- Eauto
- Elim
- Elimschemes
- Eqdecide
- Eqschemes
- Equality
- Hints
  - Hint_db
- Hipattern
- Ind_tables
- Inv
- Leminv
- Tacticals
  - New
- Tactics
  - New
  - Simple
- Term_dnet
  - IDENT
  - Make
    
    Ident
    
    Opt
  - OPT
  - S
coq.toplevel
- Coqargs
- Coqinit
- Coqloop
- Coqtop
- G_toplevel
  - Toplevel_
- Usage
- Vernac
  - State
- WorkerLoop
coq.vernac
- Assumptions
- Auto_ind_decl
- Class
- Classes
- ComAssumption
- ComDefinition
- ComFixpoint
- ComInductive
- ComProgramFixpoint
- DeclareDef
- Egramcoq
- Egramml
- ExplainErr
- G_proofs
- G_vernac
- Himsg
- Indschemes
- Lemmas
- Locality
- Metasyntax
- Misctypes
- Mltop
- Obligations
- Ppvernac
- Proof_using
- Pvernac
  - Vernac_
- Record
- Search
- Topfmt
- Vernacentries
- Vernacexpr
- Vernacinterp
- Vernacprop
- Vernacstate

Legend:
Library
Module
Module type
Parameter
Class
Class type

val do_fixpoint : 
  Decl_kinds.locality ->
  Decl_kinds.polymorphic ->
  (Vernacexpr.fixpoint_expr * Vernacexpr.decl_notation list) list ->
  unit

val do_cofixpoint : 
  Decl_kinds.locality ->
  Decl_kinds.polymorphic ->
  (Vernacexpr.cofixpoint_expr * Vernacexpr.decl_notation list) list ->
  unit

type structured_fixpoint_expr = {

fix_name : Names.Id.t;
fix_univs : Constrexpr.universe_decl_expr option;
fix_annot : Names.lident option;
fix_binders : Constrexpr.local_binder_expr list;
fix_body : Constrexpr.constr_expr option;
fix_type : Constrexpr.constr_expr;

}

val interp_recursive : 
  program_mode:bool ->
  cofix:bool ->
  structured_fixpoint_expr list ->
  Vernacexpr.decl_notation list ->
  (Environ.env * EConstr.named_context * UState.universe_decl * Evd.evar_map)
  * (Names.Id.t list * EConstr.constr option list * EConstr.types list)
  * (EConstr.rel_context * Impargs.manual_explicitation list * int option) list

val extract_fixpoint_components : 
  bool ->
  (Vernacexpr.fixpoint_expr * Vernacexpr.decl_notation list) list ->
  structured_fixpoint_expr list * Vernacexpr.decl_notation list

val extract_cofixpoint_components : 
  (Vernacexpr.cofixpoint_expr * Vernacexpr.decl_notation list) list ->
  structured_fixpoint_expr list * Vernacexpr.decl_notation list

type recursive_preentry =
  Names.Id.t list * Constr.constr option list * Constr.types list

val interp_fixpoint : 
  cofix:bool ->
  structured_fixpoint_expr list ->
  Vernacexpr.decl_notation list ->
  recursive_preentry
  * UState.universe_decl
  * UState.t
  * (EConstr.rel_context * Impargs.manual_implicits * int option) list

val declare_fixpoint : 
  Decl_kinds.locality ->
  Decl_kinds.polymorphic ->
  (recursive_preentry
   * UState.universe_decl
   * UState.t
   * (Constr.rel_context * Impargs.manual_implicits * int option) list) ->
  Proof_global.lemma_possible_guards ->
  Vernacexpr.decl_notation list ->
  unit

val declare_cofixpoint : 
  Decl_kinds.locality ->
  Decl_kinds.polymorphic ->
  (recursive_preentry
   * UState.universe_decl
   * UState.t
   * (Constr.rel_context * Impargs.manual_implicits * int option) list) ->
  Vernacexpr.decl_notation list ->
  unit

val compute_possible_guardness_evidences : 
  (('a, 'b) Context.Rel.pt * 'c * int option) ->
  int list