# ssreflect 1.14.0-6build1 source package in Ubuntu

## Changelog

ssreflect (1.14.0-6build1) jammy; urgency=medium * Rebuild against new OCAML ABI. -- Gianfranco Costamagna <email address hidden> Wed, 16 Feb 2022 21:48:10 +0100

## Upload details

- Uploaded by:
- Gianfranco Costamagna

- Uploaded to:
- Jammy

- Original maintainer:
- Debian OCaml Maintainers

- Architectures:
- all

- Section:
- math

- Urgency:
- Medium Urgency

## See full publishing history Publishing

Series | Published | Component | Section |
---|

## Downloads

File | Size | SHA-256 Checksum |
---|---|---|

ssreflect_1.14.0.orig.tar.gz | 1.3 MiB | d259cc95a2f8f74c6aa5f3883858c9b79c6e87f769bde9a415115fa4876ebb31 |

ssreflect_1.14.0-6build1.debian.tar.xz | 12.1 KiB | 765994f567015eb61da3074a69c979a95eac0714633f58f326286ca4d803a1bf |

ssreflect_1.14.0-6build1.dsc | 2.5 KiB | 0006d96cbdf78614b43593c0b0d8c78a25e4845494b9bec213e123d8f15f4513 |

### Available diffs

- diff from 1.14.0-6 (in Debian) to 1.14.0-6build1 (339 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...).