-
Notifications
You must be signed in to change notification settings - Fork 21
/
coq-color.opam
109 lines (92 loc) · 2.38 KB
/
coq-color.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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
opam-version: "2.0"
synopsis: "A library on rewriting theory and termination"
homepage: "http://color.inria.fr/"
license: "CeCILL-2.1"
bug-reports: "https://github.com/fblanqui/color/issues"
depends: [
"ocaml"
"coq" {>= "8.14"}
"coq-bignums" {>= "8.14"}
]
build: [make "-j%{jobs}%"]
install: [make "-f" "Makefile.coq" "install"]
flags: light-uninstall
remove: ["rm" "-R" "%{lib}%/coq/user-contrib/CoLoR"]
maintainer: "frederic.blanqui@inria.fr"
authors: [
"Frédéric Blanqui"
"Adam Koprowski"
"Sébastien Hinderer"
"Pierre-Yves Strub"
"Sidi Ould Biha"
"Solange Coupet-Grimal"
"William Delobel"
"Hans Zantema"
"Stéphane Leroux"
"Léo Ducas"
"Johannes Waldmann"
"Qiand Wang"
"Lianyi Zhang"
"Sorin Stratulat"
]
tags: [
"date:2020-09-24"
"logpath:CoLoR"
"category:Computer Science/Algorithms/Correctness proofs of algorithms"
"category:Computer Science/Data Types and Data Structures"
"category:Computer Science/Lambda Calculi"
"category:Mathematics/Algebra"
"category:Mathematics/Combinatorics and Graph Theory"
"category:Mathematics/Logic/Type theory"
"category:Miscellaneous/Extracted Programs/Type checking unification and normalization"
"keyword:rewriting"
"keyword:termination"
"keyword:lambda calculus"
"keyword:list"
"keyword:multiset"
"keyword:polynom"
"keyword:vectors"
"keyword:matrices"
"keyword:FSet"
"keyword:FMap"
"keyword:term"
"keyword:context"
"keyword:substitution"
"keyword:universal algebra"
"keyword:varyadic term"
"keyword:string"
"keyword:alpha-equivalence"
"keyword:de bruijn indices"
"keyword:simple types"
"keyword:matching"
"keyword:unification"
"keyword:relation"
"keyword:ordering"
"keyword:quasi-ordering"
"keyword:lexicographic ordering"
"keyword:ring"
"keyword:semiring"
"keyword:well-founded"
"keyword:noetherian"
"keyword:finitely branching"
"keyword:dependent choice"
"keyword:infinite sequences"
"keyword:non-termination"
"keyword:loop"
"keyword:graph"
"keyword:path"
"keyword:transitive closure"
"keyword:strongly connected component"
"keyword:topological ordering"
"keyword:rpo"
"keyword:horpo"
"keyword:dependency pair"
"keyword:dependency graph"
"keyword:semantic labeling"
"keyword:reducibility"
"keyword:Girard"
"keyword:fixpoint theorem"
"keyword:Tarski"
"keyword:pigeon-hole principle"
"keyword:Ramsey theorem"
]