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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
Source: ssreflect
Priority: optional
Maintainer: Debian OCaml Maintainers <debian-ocaml-maint@lists.debian.org>
Uploaders: Stéphane Glondu <glondu@debian.org>,
Julien Puydt <jpuydt@debian.org>,
Ralf Treinen <treinen@debian.org>
Build-Depends:
debhelper-compat (= 13), dh-coq,
coq (>= 8.11), libcoq-hierarchy-builder, libcoq-stdlib,
lua5.4
Rules-Requires-Root: no
Standards-Version: 4.7.0
Section: math
Homepage: https://math-comp.github.io/math-comp/
Vcs-Browser: https://salsa.debian.org/ocaml-team/ssreflect
Vcs-Git: https://salsa.debian.org/ocaml-team/ssreflect.git
Package: libcoq-mathcomp-algebra
Architecture: any
Depends:
libcoq-mathcomp-fingroup (= ${binary:Version}),
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (algebra)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the algebra part of the library (ring, fields,
ordered fields, real fields, modules, algebras, integers, rationals,
polynomials, matrices, vector spaces...).
Package: libcoq-mathcomp-character
Architecture: any
Depends:
libcoq-mathcomp-field (= ${binary:Version}),
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (character)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the character theory part of the library
(group representations, characters and class functions).
Package: libcoq-mathcomp-field
Architecture: any
Depends:
libcoq-mathcomp-solvable (= ${binary:Version}),
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (field)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the field theory part of the library
(field extensions, Galois theory, algebraic numbers, cyclotomic
polynomials).
Package: libcoq-mathcomp-fingroup
Architecture: any
Depends:
libcoq-mathcomp-ssreflect (= ${binary:Version}),
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (finite groups)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the finite groups theory part of the library
(finite groups, group quotients, group morphisms, group presentation,
group action...).
Package: libcoq-mathcomp-solvable
Architecture: any
Depends:
libcoq-mathcomp-algebra (= ${binary:Version}),
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (finite groups II)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the second finite groups theory part of the
library (abelian groups, center, commutator, Jordan-Holder series,
Sylow theorems...).
Package: libcoq-mathcomp-ssreflect
Architecture: any
Depends:
libcoq-core-ocaml,
${misc:Depends}, ${coq:Depends}
Provides: ${coq:Provides}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Description: Mathematical Components library for Coq (small scale reflection)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the small scale reflection language extension
and the minimal set of libraries to take advantage of it (sequences,
booleans and boolean predicates, natural numbers and types with decidable
equality, finite types, finite sets, finite functions, finite graphs,
basic arithmetics and prime numbers, big operators...).
Package: libcoq-mathcomp
Architecture: any
Depends:
libcoq-mathcomp-algebra (= ${binary:Version}),
libcoq-mathcomp-character (= ${binary:Version}),
libcoq-mathcomp-field (= ${binary:Version}),
libcoq-mathcomp-fingroup (= ${binary:Version}),
libcoq-mathcomp-solvable (= ${binary:Version}),
libcoq-mathcomp-ssreflect (= ${binary:Version}),
${misc:Depends}
Breaks: libssreflect-coq (<= ${binary:Version})
Replaces: libssreflect-coq
Provides: ssreflect, libmathcomp-coq, libssreflect-coq
Description: Mathematical Components library for Coq (all)
The Mathematical Components Library is an extensive and coherent
repository of formalized mathematical theories. It is based on the
Coq proof assistant, powered with the Coq/SSReflect language.
.
These formal theories cover a wide spectrum of topics, ranging from
the formal theory of general-purpose data structures like lists,
prime numbers or finite graphs, to advanced topics in algebra.
.
The formalization technique adopted in the library, called "small
scale reflection", leverages the higher-order nature of Coq's
underlying logic to provide effective automation for many small,
clerical proof steps. This is often accomplished by restating
("reflecting") problems in a more concrete form, hence the name. For
example, arithmetic comparison is not an abstract predicate, but
rather a function computing a Boolean.
.
This package installs the full Mathematical Components library.
|
