package coq

  1. Overview
  2. Docs
Formal proof management system

Install 

dune-project
 Dependency

coq.inria.fr Edit opam file Versions (40)

Authors

  1. T
    The Coq development team, INRIA, CNRS, and contributors.

Maintainers

  1. C
    coqdev@inria.fr

Sources

coq-8.15.0.tar.gz
sha256=73466e61f229b23b4daffdd964be72bd7a110963b9d84bd4a86bb05c5dc19ef3

doc/coq-core.kernel/Context/Rel/index.html

Module Context.RelSource

Representation of contexts that can capture anonymous as well as non-anonymous variables. Individual declarations are then designated by de Bruijn indexes.

Sourcemodule Declaration : sig ... end
Sourcetype ('constr, 'types) pt = ('constr, 'types) Declaration.pt list

Rel-context is represented as a list of declarations. Inner-most declarations are at the beginning of the list. Outer-most declarations are at the end of the list.

Sourceval empty : ('c, 't) pt

empty rel-context

Sourceval add : ('c, 't) Declaration.pt -> ('c, 't) pt -> ('c, 't) pt

Return a new rel-context enriched by with a given inner-most declaration.

Sourceval length : ('c, 't) pt -> int

Return the number of local declarations in a given rel-context.

Sourceval equal : ('c -> 'c -> bool) -> ('c, 'c) pt -> ('c, 'c) pt -> bool

Check whether given two rel-contexts are equal.

Sourceval nhyps : ('c, 't) pt -> int

Return the number of local assumptions in a given rel-context.

Sourceval lookup : int -> ('c, 't) pt -> ('c, 't) Declaration.pt

Return a declaration designated by a given de Bruijn index.

  • raises Not_found

    if the designated de Bruijn index outside the range.

Sourceval map : ('c -> 'c) -> ('c, 'c) pt -> ('c, 'c) pt

Map all terms in a given rel-context.

Sourceval map_with_binders : (int -> 'c -> 'c) -> ('c, 'c) pt -> ('c, 'c) pt

Map all terms in a given rel-context taking into account the position of the binder in the context starting at 1.

Sourceval iter : ('c -> unit) -> ('c, 'c) pt -> unit

Perform a given action on every declaration in a given rel-context.

Sourceval fold_inside : ('a -> ('c, 't) Declaration.pt -> 'a) -> init:'a -> ('c, 't) pt -> 'a

Reduce all terms in a given rel-context to a single value. Innermost declarations are processed first.

Sourceval fold_outside : (('c, 't) Declaration.pt -> 'a -> 'a) -> ('c, 't) pt -> init:'a -> 'a

Reduce all terms in a given rel-context to a single value. Outermost declarations are processed first.

Sourceval to_tags : ('c, 't) pt -> bool list

Map a given rel-context to a list where each local assumption is mapped to true and each local definition is mapped to false. The resulting list is in reverse order compared to the order of declarations in the context.

Sourceval drop_bodies : ('c, 't) pt -> ('c, 't) pt

Turn all LocalDef into LocalAssum, leave LocalAssum unchanged.

Sourceval instance : (int -> 'r) -> int -> ('c, 't) pt -> 'r array

instance mk n Γ builds an instance args such that Γ,Δ ⊢ args:Γ with n = |Δ| and with the local definitions of Γ skipped in args where mk is used to build the corresponding variables. Example: for x:T, y:=c, z:U and n=2, it gives mk 5, mk 3.

Sourceval instance_list : (int -> 'r) -> int -> ('c, 't) pt -> 'r list

instance_list is like instance but returning a list.

Sourceval to_extended_vect : (int -> 'r) -> int -> ('c, 't) pt -> 'r array
  • deprecated Use synonymous [Context.Rel.instance]
Sourceval to_extended_list : (int -> 'r) -> int -> ('c, 't) pt -> 'r list
  • deprecated Use synonymous [Context.Rel.instance_list]