Source: ssreflect Priority: optional Maintainer: Debian OCaml Maintainers Uploaders: Stéphane Glondu , Julien Puydt , Ralf Treinen Build-Depends: debhelper-compat (= 13), dh-coq, coq, libcoq-hierarchy-builder, libcoq-stdlib, lua5.4 Rules-Requires-Root: no Standards-Version: 4.7.2 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}), libcoq-mathcomp-order (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} 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-boot Architecture: any Depends: ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} Description: Mathematical Components library for Coq (boot) 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 includes the small scale reflection proof language, and the minimal set of libraries to take advantage of it: lists, boolean and boolean predicates, types with decidable equality, finite sets, finite functions, finite graphs, basic arithmetics and prime numbers and big operators. Package: libcoq-mathcomp-character Architecture: any Depends: libcoq-mathcomp-field (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} 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} 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-boot (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} 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-order Architecture: any Depends: libcoq-mathcomp-boot (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} Description: Mathematical Components library for Coq (order) 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 order theory: definitions and theorems on partial orders, lattices, total orders, etc. Package: libcoq-mathcomp-solvable Architecture: any Depends: libcoq-mathcomp-algebra (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} 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, libcoq-mathcomp-boot (= ${binary:Version}), libcoq-mathcomp-order (= ${binary:Version}), ${misc:Depends}, ${coq:Depends} Provides: ${coq:Provides} 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. . You should install libcoq-mathcomp-boot and libcoq-mathcomp-order then remove this package -- it is a compatibility package for previous installations. 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}), mathcomp-doc, ${misc:Depends} 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. Package: mathcomp-doc Section: doc Architecture: all Multi-Arch: foreign Depends: ${misc:Depends} Description: Mathematical Components library for Coq (doc) 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 Mathematical Components documentation.