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.18.0.tar.gz
    
    
        
    
  
  
  
    
  
  
    
  
        md5=8d852367b54f095d9fbabd000304d450
    
    
  sha512=46922d5f2eb6802a148a52fd3e7f0be8370c93e7bc33cee05cf4a2044290845b10ccddbaa306f29c808e7c5019700763e37e45ff6deb507b874a4348010fed50
    
    
  doc/coq-core.kernel/Reduction/index.html
Module ReductionSource
None of these functions do eta reduction
Builds an application node, reducing beta redexes it may produce.
Builds an application node, reducing beta redexes it may produce.
Builds an application node, reducing beta redexe it may produce.
Pseudo-reduction rule Prod(x,A,B) a --> Bx\a
Source
val hnf_prod_applist_decls : 
  Environ.env ->
  int ->
  Constr.types ->
  Constr.constr list ->
  Constr.typesIn hnf_prod_applist_decls n c args, c is supposed to (whd-)reduce to the form ∀Γ.t with Γ of length n and possibly with let-ins; it returns t with the assumptions of Γ instantiated by args and the local definitions of Γ expanded.
Compatibility alias for Term.lambda_appvect_decls
Source
val hnf_decompose_prod_decls : 
  Environ.env ->
  Constr.types ->
  Constr.rel_context * Constr.typesSource
val hnf_decompose_lambda_decls : 
  Environ.env ->
  Constr.constr ->
  Constr.rel_context * Constr.constrSource
val hnf_decompose_lambda_n_decls : 
  Environ.env ->
  int ->
  Constr.constr ->
  Constr.rel_context * Constr.constrDeprecated
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >