FiniteCategories: Finite categories and usual categorical constructions on them.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
This package provides tools to create categories at the value level. This is different from the Hask category where types are objects in a category with infinite objects and arrows, here we construct categories where objects and arrows are arbitrary values so that we can change categories during runtime. Each category implements two functions following the category structure axioms : ar which returns arrows between two objects of the category and identity which returns the identity of an object. A FiniteCategory implements an additional function : ob which returns objects of the category. Thanks to these functions, we can construct automatically all the usual constructions on the categories (limits and colimits, adjunctions, Yoneda embedding, etc.) Functors are different from usual Functor typeclass, we store functors as mapping between objects and morphisms of two categories. This package is also different from the package data-category because we can enumerate objects and arrows in a finite category. This allows us to construct limit, colimits, adjunctions, etc. automatically for arbitrary finite categories. On the other hand, we loose typecheck at compilation time which ensures that composition is sound in Hask, composition in our package might lead to an error raised during runtime. See the Readme file for installation help.
[Skip to Readme]
Properties
| Versions | 0.1.0.0, 0.2.0.0, 0.2.0.0, 0.3.0.0, 0.3.0.1, 0.4.0.0, 0.5.0.0, 0.6.0.0, 0.6.0.1, 0.6.0.2, 0.6.1.0, 0.6.1.1, 0.6.2.0, 0.6.3.0, 0.6.3.1, 0.6.4.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.15.0.0 && <4.16), containers (>=0.6.4 && <0.7), directory (>=1.3.6 && <1.4), fgl (>=5.7.0 && <5.8), filepath (>=1.4.2 && <1.5), graphviz (>=2999.20.1 && <2999.21), process (>=1.6.11 && <1.7), random (>=1.2.1 && <1.3), text (>=1.2.4 && <1.3), WeakSets (>=1.4.0.0 && <1.4.0.1) [details] |
| License | GPL-3.0-or-later |
| Author | Guillaume Sabbagh |
| Maintainer | guillaumesabbagh@protonmail.com |
| Category | Maths, Data |
| Home page | https://gitlab.utc.fr/gsabbagh/FiniteCategories |
| Uploaded | by gsabbagh at 2023-03-13T16:41:43Z |
Modules
- Math
- Math.Categories
- Math.Categories.CommaCategory
- Math.Categories.ConeCategory
- Math.Categories.FinCat
- Math.Categories.FinGrph
- Math.Categories.FinSet
- Math.Categories.FunctorCategory
- Math.Categories.Galaxy
- Math.Categories.Omega
- Math.Categories.Opposite
- Math.Categories.OrdinalCategory
- Math.Categories.PresheafCategory
- Math.Categories.TotalOrder
- Math.Category
- Math.FiniteCategories
- Math.FiniteCategories.All
- Math.FiniteCategories.CommaCategory
- Math.FiniteCategories.CommaCategory.Example
- Math.FiniteCategories.CompositionGraph
- Math.FiniteCategories.CompositionGraph.Example
- Math.FiniteCategories.ConeCategory
- Math.FiniteCategories.ConeCategory.Example
- Math.FiniteCategories.DiscreteCategory
- Math.FiniteCategories.DiscreteCategory.Example
- Math.FiniteCategories.Ens
- Math.FiniteCategories.Ens.Example
- Math.FiniteCategories.Examples
- FinCat
- Math.FiniteCategories.FinCat.Example
- FinGrph
- Math.FiniteCategories.FinGrph.Example
- Math.FiniteCategories.FullSubcategory
- Math.FiniteCategories.FunctorCategory
- Math.FiniteCategories.FunctorCategory.Example
- Math.FiniteCategories.Hat
- Math.FiniteCategories.Hat.Example
- Math.FiniteCategories.NumberCategory
- Math.FiniteCategories.NumberCategory.Example
- Math.FiniteCategories.One
- Math.FiniteCategories.One.Example
- Math.FiniteCategories.Opposite
- Math.FiniteCategories.Opposite.Example
- Math.FiniteCategories.Parallel
- Math.FiniteCategories.Parallel.Example
- Math.FiniteCategories.SafeCompositionGraph
- Math.FiniteCategories.SafeCompositionGraph.Example
- Math.FiniteCategories.Square
- Math.FiniteCategories.Square.Example
- Math.FiniteCategories.Subcategory
- Math.FiniteCategories.V
- Math.FiniteCategories.V.Example
- Math.FiniteCategory
- Math.FiniteCategoryError
- Math.Functors
- Math.Functors.Adjunction
- Math.Functors.Adjunction.Example
- Math.Functors.DataMigration
- Math.Functors.DataMigration.Example
- Math.Functors.DiagonalFunctor
- Math.Functors.DiagonalFunctor.Example
- Math.Functors.Examples
- Math.Functors.KanExtension
- Math.Functors.KanExtension.Example
- Math.Functors.SetValued
- Math.Functors.SetValued.Example
- YonedaEmbedding
- Math.Functors.YonedaEmbedding.Example
- Math.Functors.Adjunction
- IO
- FiniteCategories
- Math.IO.FiniteCategories.ExportGraphViz
- Math.IO.PrettyPrint
- FiniteCategories
- Math.Categories
Downloads
- FiniteCategories-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for FiniteCategories-0.2.0.0
[back to package description]FiniteCategories
The goal of this project is to represent small finite categories in order to make usual constructions automatically on them (e.g. (co)limits, (co)completion, adjunctions, etc.)
Table of Contents
General Info
This package provides tools to create categories at the value level. This is different from the Hask category where types are objects in a category with an infinite number of objects and arrows, here we construct categories where objects and arrows are arbitrary values so that we can change categories during runtime. Each category implements two functions following the category structure axioms : ar which returns arrows between two objects of the category and identity which returns the identity of an object. Each FiniteCategory implements an additional function : ob which returns the objects of the category. Thanks to theses functions, we can construct automatically all the usual constructions on the categories (limits and colimits, adjunctions, Yoneda embedding, etc.) Functors are different from usual Functor typeclass, we store functors as mapping between objects and morphisms of two categories which respect the category structure.
This package is also different from the package data-category because we can enumerate objects and arrows in a category. This allows us to construct limit, colimits, adjunctions, etc. automatically for arbitrary finite categories. On the other hand, we loose typecheck at compilation time which ensures that composition is sound in Hask, composition in our package might lead to an error raised during runtime.
Technologies
The project uses GraphViz for visualizing the categories created.
There is another version no longer maintained programmed in Python : repository link
Installation
To use the graphviz exports, you must first install graphviz (see graphviz website) and make sure that Graphviz folder is in the path (dot should be a callable program from your terminal, if you are on Windows see this tutorial and if you are on unix see this tutorial).
Then you can check the numerous examples provided to understand how to use the package.
Collaboration
All contributions are appreciated! Contact me by email for any information.
Usage
To run all examples of the project, clone the repository and run in a terminal from the repository the following command :
cabal test
You can then find the graphviz output in the folder OutputGraphViz/.
Examples
A category exported with graphviz looks like the following image :
A diagram on this category selecting two objects C and D is represented next :
A cone on this diagram follows, the apex of the cone is in green, its legs are in yellow and the diagram is in blue :
The limiting cone is represented below, it is the product of the two objects C and D.
