package coq-cecoa
  Implicit-complexity Coq library to prove that some programs are computable in polynomial time
Install
Dune Dependency
Authors
Maintainers
Sources
  
    
      v1.0.0.tar.gz
    
    
        
    
  
  
  
    
  
        md5=123728805ad3e0a91c38d61f37d0b05d
    
    
  Description
Tags
category:Computer Science/Algorithms/Complexity keyword:implicit complexity keyword:polynomial time keyword:rewriting logpath:Cecoa date:2018-09-10Published: 13 Sep 2018
Dependencies (3)
- coq-bellantonicook
- 
  
    coq
  
  
    >= "8.6.0" & < "8.9.0~"
- ocaml
Dev Dependencies
None
Used by
None
Conflicts
None
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page