ssreflect 1.15.0-1build3 source package in Ubuntu
Changelog
ssreflect (1.15.0-1build3) lunar; urgency=medium * Rebuild against new OCAML ABIs. -- Gianfranco Costamagna <email address hidden> Sat, 03 Dec 2022 10:52:30 +0100
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Lunar
- Original maintainer:
- Debian OCaml Maintainers
- Architectures:
- any
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
ssreflect_1.15.0.orig.tar.gz | 1.3 MiB | 33105615c937ae1661e12e9bc00e0dbad143c317a6ab78b1a15e1d28339d2d95 |
ssreflect_1.15.0-1build3.debian.tar.xz | 12.2 KiB | 76970169484745c5c4884c00f69fdc5bdd36a62da94d31fc1bd2bfd57d3f36a0 |
ssreflect_1.15.0-1build3.dsc | 2.5 KiB | 7f2a61f09471bd7f3bb69c796c5bf3490bf56978483b6474654f80cc52aae0f3 |
Available diffs
- diff from 1.15.0-1 (in Debian) to 1.15.0-1build3 (365 bytes)
- diff from 1.15.0-1build2 to 1.15.0-1build3 (312 bytes)
Binary packages built by this source
- libcoq-mathcomp: 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.
- libcoq-mathcomp-algebra: 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...).
- libcoq-mathcomp-character: 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).
- libcoq-mathcomp-field: 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).
- libcoq-mathcomp-fingroup: 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...).
- libcoq-mathcomp-solvable: 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...).
- libcoq-mathcomp-ssreflect: 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...).