package coq-cecoa

  1. Overview
  2. No Docs
Implicit-complexity Coq library to prove that some programs are computable in polynomial time

Install

Dune Dependency

github.com Edit opam file Versions (1)

Authors

  1. H
    Hugo Férée
  2. S
    Samuel Hym
  3. M
    Micaela Mayero
  4. J
    Jean-Yves Moyen
  5. D
    David Nowak

Maintainers

  1. D
    David Nowak <david.nowak@univ-lille.fr>

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-10

Published: 13 Sep 2018

Dependencies (3)

  1. coq-bellantonicook
  2. coq >= "8.6.0" & < "8.9.0~"
  3. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None