-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcoq-pocklington.opam
36 lines (31 loc) · 1.06 KB
/
coq-pocklington.opam
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
# This file was generated from `meta.yml`, please do not edit manually.
# Follow the instructions on https://github.com/coq-community/templates to regenerate.
opam-version: "2.0"
maintainer: "palmskog@gmail.com"
version: "dev"
homepage: "https://github.com/coq-community/pocklington"
dev-repo: "git+https://github.com/coq-community/pocklington.git"
bug-reports: "https://github.com/coq-community/pocklington/issues"
license: "LGPL-2.1-or-later"
synopsis: "Pocklington's criterion for primality in Coq"
description: """
Coq formalization of Pocklington's criterion for checking primality of
large natural numbers. Includes a formal proof of Fermat's little theorem."""
build: ["dune" "build" "-p" name "-j" jobs]
depends: [
"dune" {>= "2.5"}
"coq" {(>= "8.7" & < "8.17~") | (= "dev")}
]
tags: [
"category:Mathematics/Arithmetic and Number Theory/Number Theory"
"keyword:Pocklington"
"keyword:number theory"
"keyword:prime numbers"
"keyword:primality"
"keyword:Fermat's little theorem"
"logpath:Pocklington"
]
authors: [
"Olga Caprotti"
"Martijn Oostdijk"
]