package coq-core
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  The Coq Proof Assistant -- Core Binaries and Tools
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      coq-8.19.2.tar.gz
    
    
        
    
  
  
  
    
  
  
    
  
        md5=5d1187d5e44ed0163f76fb12dabf012e
    
    
  sha512=91bc81530fa4f6498961583ad51eac5001f139881788b88e360a866ad8e2a6e2c5bce86d1a580ab4cd4782bf49d48318767df82471ce33ba3ac143e5569ad33c
    
    
  doc/coq-core.pretyping/Reductionops/Stack/index.html
Module Reductionops.StackSource
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)"
  >