package coq-core
The Coq Proof Assistant -- Core Binaries and Tools
Install
Dune Dependency
Authors
Maintainers
Sources
coq-8.19.0.tar.gz
md5=64b49dbc3205477bd7517642c0b9cbb6
sha512=02fb5b4fb575af79e092492cbec6dc0d15a1d74a07f827f657a72d4e6066532630e5a6d15be4acdb73314bd40b9a321f9ea0584e0ccfe51fd3a56353bd30db9b
doc/coq-core.pretyping/Reductionops/Stack/index.html
Module Reductionops.Stack
Source
Source
type member =
| App of app_node
| Case of case_stk
| Proj of Names.Projection.t * Sorts.relevance
| Fix of EConstr.fixpoint * t
| Primitive of CPrimitives.t * Names.Constant.t * EConstr.EInstance.t * t * CPrimitives.args_red
fold2 f x sk1 sk2
folds f
on any pair of term in (sk1,sk2)
.
append_app args sk
pushes array of arguments args
on sk
append_app_list args sk
pushes list of arguments args
on sk
if strip_app sk
= (sk1,sk2)
, then sk = sk1 @ sk2
with sk1
purely applicative and sk2
does not start with an argument
decomp sk
extracts the first argument of reversed stack sk
is there is some
list_of_app_stack sk
either returns Some sk
turned into a list of arguments if sk
is purely applicative and None
otherwise
args_size sk
returns the number of arguments available at the head of sk
zip sigma t sk
Source
val expand_case :
Environ.env ->
Evd.evar_map ->
case_stk ->
Constr.case_info
* EConstr.EInstance.t
* EConstr.constr array
* ((EConstr.rel_context * EConstr.constr) * Sorts.relevance)
* (EConstr.rel_context * EConstr.constr) array
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>