ssreflect 1.14.0-7 source package in Ubuntu
Changelog
ssreflect (1.14.0-7) unstable; urgency=medium * Better fix for Breaks+Replaces (Closes: #1005852). -- Julien Puydt <email address hidden> Wed, 16 Feb 2022 22:19:18 +0100
Upload details
- Uploaded by:
- Debian OCaml Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian OCaml Maintainers
- Architectures:
- all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Jammy | release | universe | math |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
ssreflect_1.14.0-7.dsc | 2.5 KiB | d18ce8f4ab278f808c5cd6406bdfbfbbf234d2013ff61a7a19d16975b4e89e4f |
ssreflect_1.14.0.orig.tar.gz | 1.3 MiB | d259cc95a2f8f74c6aa5f3883858c9b79c6e87f769bde9a415115fa4876ebb31 |
ssreflect_1.14.0-7.debian.tar.xz | 12.1 KiB | 55a9e826008a826f30173c746fce5dc300d40c0ef8c5ba795d9a0e51cfda67cf |
Available diffs
- diff from 1.13.0-1 to 1.14.0-7 (10.8 KiB)
- diff from 1.14.0-6build1 (in Ubuntu) to 1.14.0-7 (730 bytes)
No changes file available.
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: No summary available for libcoq-mathcomp-algebra in ubuntu kinetic.
No description available for libcoq-
mathcomp- algebra in ubuntu kinetic.
- libcoq-mathcomp-character: No summary available for libcoq-mathcomp-character in ubuntu kinetic.
No description available for libcoq-
mathcomp- character in ubuntu kinetic.
- libcoq-mathcomp-field: No summary available for libcoq-mathcomp-field in ubuntu kinetic.
No description available for libcoq-
mathcomp- field in ubuntu kinetic.
- libcoq-mathcomp-fingroup: No summary available for libcoq-mathcomp-fingroup in ubuntu kinetic.
No description available for libcoq-
mathcomp- fingroup in ubuntu kinetic.
- libcoq-mathcomp-solvable: No summary available for libcoq-mathcomp-solvable in ubuntu kinetic.
No description available for libcoq-
mathcomp- solvable in ubuntu kinetic.
- 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...).