package coq-bertrand

  1. Overview
  2. No Docs
Correctness of Knuth's algorithm for prime numbers

Install

Dune Dependency

github.com Edit opam file Versions (8)

Authors

  1. L
    Laurent Théry

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.6.0.tar.gz
md5=e034915c979ff557e1eb977c3bb388a7

Description

A proof of correctness of the algorithm as described in `The Art of Computer Programming: Fundamental Algorithms' by Knuth, pages 147-149

Tags

keyword: Knuth's algorithm keyword: prime numbers keyword: Bertrand's postulate category: Mathematics/Arithmetic and Number Theory/Number theory category: Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs based on external tools category: Miscellaneous/Extracted Programs/Arithmetic date: 2002

Published: 20 Nov 2018

Dependencies (2)

  1. coq >= "8.6" & < "8.7~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None