-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathcoq-huffman.opam
37 lines (32 loc) · 1.22 KB
/
coq-huffman.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
37
# 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: "[email protected]"
version: "dev"
homepage: "https://github.com/coq-community/huffman"
dev-repo: "git+https://github.com/coq-community/huffman.git"
bug-reports: "https://github.com/coq-community/huffman/issues"
doc: "https://coq-community.github.io/huffman/"
license: "LGPL-2.1-or-later"
synopsis: "Coq proof of the correctness of the Huffman coding algorithm"
description: """
This projects contains a Coq proof of the correctness of the Huffman coding algorithm,
as described in David A. Huffman's paper A Method for the Construction of Minimum-Redundancy
Codes, Proc. IRE, pp. 1098-1101, September 1952."""
build: ["dune" "build" "-p" name "-j" jobs]
depends: [
"dune" {>= "3.5"}
"coq" {(>= "8.12" & < "8.20~") | (= "dev")}
]
tags: [
"category:Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms"
"category:Miscellaneous/Extracted Programs/Combinatorics"
"keyword:data compression"
"keyword:code"
"keyword:huffman tree"
"logpath:Huffman"
]
authors: [
"Laurent Théry"
"Karl Palmskog"
]