package coq-higman-cf
  A direct constructive proof of Higman's Lemma
Install
Dune Dependency
Authors
Maintainers
Sources
  
    
      v8.10.0.tar.gz
    
    
        
    
  
  
  
    
  
        md5=27d30246ec18035e8a687c43531a5c23
    
    
  Description
This development formalizes in Coq the Coquand-Friedlender proof of Higman's lemma for a two-letter alphabet. An efficient program can be extracted from the proof.
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
On This Page