Specification language
match
in
type_scope
function_scope
Arguments
Proofs
Proof using
Scheme
Derive
Inversion
dependent destruction
dependent induction
lra
lia
nra
nia
psatz
zify
nsatz
Type
L
Using Coq
Functional
coqrc
-vos
Appendix
algebraic universe
alpha-convertible
attribute
backtracking
backtracking point
backward reasoning
beta-redex
beta-reduction
body
boolean attribute
branching
Calculus of Inductive Constructions
command
conclusion
cone expression
constant
constructor
context-local definition
contraction
convertible
de Bruijn criterion
definitional equality
delta-reduction
dependent premise
dependent product
equality
eta-expansion
existential variable
expansion
field
first success
flag
focus
forward reasoning
global environment
goal
head
head constant
hole
hypothesis
implicit argument
induction principle
inductive parameter
inductively defined proposition
inhabitant
inhabited
interpretation
iota-reduction
left associative
Leibniz equality
library
load path
local context
logical name
logical path
lonely notation
non-dependent premise
non-dependent product
notation scope
occurrence
opaque
option
package
physical path
plugin
prelude
premise
product
projection
proof mode
proof state
proof term
proposition
quotient
quotient set
records
reduction
relevance mark
reversible coercion
right associative
section-local definition
sentence
setoid
setoid equality
shelved
sort
sort polymorphic
sort qualities
standard library
strict proposition
subgoal
table
tactic
term
transparent
type
unfold
uniform inheritance condition
variable
volatile cast
weak-head normal form
well-typed
zeta-reduction