package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

Dune Dependency

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

Authors

T

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

Maintainers

C

coqdev@inria.fr

Sources

coq-8.14.1.tar.gz

sha256=3cbfc1e1a72b16d4744f5b64ede59586071e31d9c11c811a0372060727bfd9c3

doc/coq-core.kernel/CClosure/RedFlags/index.html

Module `CClosure.RedFlags`Source

Sourcetype reds

Sourcetype red_kind

The different kinds of reduction

Sourceval fBETA : red_kind

Sourceval fDELTA : red_kind

Sourceval fETA : red_kind

The fETA flag is never used by the kernel reduction but pretyping does

Sourceval fMATCH : red_kind

The fETA flag is never used by the kernel reduction but pretyping does

Sourceval fFIX : red_kind

Sourceval fCOFIX : red_kind

Sourceval fZETA : red_kind

Sourceval fCONST : Names.Constant.t -> red_kind

Sourceval fVAR : Names.Id.t -> red_kind

Sourceval no_red : reds

No reduction at all

Sourceval red_add : reds -> red_kind -> reds

Adds a reduction kind to a set

Sourceval red_sub : reds -> red_kind -> reds

Removes a reduction kind to a set

Sourceval red_add_transparent : reds -> TransparentState.t -> reds

Adds a reduction kind to a set

Sourceval red_transparent : reds -> TransparentState.t

Retrieve the transparent state of the reduction flags

Sourceval mkflags : red_kind list -> reds

Build a reduction set from scratch = iter red_add on no_red

Sourceval red_set : reds -> red_kind -> bool

Tests if a reduction kind is set

Sourceval red_projection : reds -> Names.Projection.t -> bool

This tests if the projection is in unfolded state already or is unfodable due to delta.

On This Page

The different kinds of reduction