All Projects → copumpkin → Categories

copumpkin / Categories

Licence: other
Categories parametrized by morphism equality, in Agda

Projects that are alternatives of or similar to Categories

Fluokitten
Category theory concepts in Clojure - Functors, Applicatives, Monads, Monoids and more.
Stars: ✭ 408 (+189.36%)
Mutual labels:  category-theory
Fp Core.rs
A library for functional programming in Rust
Stars: ✭ 772 (+447.52%)
Mutual labels:  category-theory
Foundational Knowledge For Programmers
List of resources about foundational knowledge for programmers (supposed to last a few decades)
Stars: ✭ 115 (-18.44%)
Mutual labels:  category-theory
Arrow
Λrrow - Functional companion to Kotlin's Standard Library
Stars: ✭ 4,771 (+3283.69%)
Mutual labels:  category-theory
Category Theory
An axiom-free formalization of category theory in Coq for personal study and practical work
Stars: ✭ 562 (+298.58%)
Mutual labels:  category-theory
Milewski Ctfp Pdf
Bartosz Milewski's 'Category Theory for Programmers' unofficial PDF and LaTeX source
Stars: ✭ 9,037 (+6309.22%)
Mutual labels:  category-theory
Scala typeclassopedia
Abstractions and constructions from math (Category theory, Abstract algebra) implementations in Scala, minimal description, links to good explanations, links to implementations in other FP languages: Haskell, Idris, Purescript, non FP too: Java, C++ and to formalizations in proof assistants: Coq (UniMath, HoTT book), Cubical Agda.
Stars: ✭ 338 (+139.72%)
Mutual labels:  category-theory
Naive functional programming
A naive approach to functional programming using TypeScript
Stars: ✭ 129 (-8.51%)
Mutual labels:  category-theory
Ltupatternfactory
Lambda the ultimate Pattern Factory: FP, Haskell, Typeclassopedia vs Software Design Patterns
Stars: ✭ 735 (+421.28%)
Mutual labels:  category-theory
Tikzcd Editor
A simple visual editor for creating commutative diagrams.
Stars: ✭ 1,627 (+1053.9%)
Mutual labels:  category-theory
Category Theory Programmers
Category theory in the context of (functional) programming
Stars: ✭ 465 (+229.79%)
Mutual labels:  category-theory
Bow
🏹 Bow is a cross-platform library for Typed Functional Programming in Swift
Stars: ✭ 538 (+281.56%)
Mutual labels:  category-theory
Unplugged
Open book about math and computer science.
Stars: ✭ 1,189 (+743.26%)
Mutual labels:  category-theory
Awesome Applied Ct
ACT community resources
Stars: ✭ 412 (+192.2%)
Mutual labels:  category-theory
Domains
A computational algebra system in Smalltalk.
Stars: ✭ 124 (-12.06%)
Mutual labels:  category-theory
Fp Resources
Functional programming great resources
Stars: ✭ 369 (+161.7%)
Mutual labels:  category-theory
Purescript Ctprelude
A Prelude with names from category theory
Stars: ✭ 46 (-67.38%)
Mutual labels:  category-theory
Cql
CQL: Categorical Query Language implementation in Haskell
Stars: ✭ 132 (-6.38%)
Mutual labels:  category-theory
Quiver
A modern commutative diagram editor for the web.
Stars: ✭ 1,799 (+1175.89%)
Mutual labels:  category-theory
Fundamental Haskell
Fundamental Haskell book, to the point terse statements on Haskell, Category theory, and related fields. Encyclopedic pocketbook of meaning. Zen kōan-like meditations of understanding. For quick or memory curve spaced repetition learning.
Stars: ✭ 88 (-37.59%)
Mutual labels:  category-theory

This library is obsolete and does not work with newer versions of Agda. It sort-of works with 2.5.2, but less and less so afterwards. It is completely broken from 2.6 onwards.

Users should instead try https://github.com/agda/agda-categories. It is not completely compatible, but close. And it is supported.


One of the main goals of this library is to be as general as possible by abstracting over notions of equality between morphisms.

Another is to keep the definitions of categorical structures as simple as possible and then where possible to prove that the simple definition is equivalent to more interesting formulations. For example, we can define a monad as recording containing a functor and two natural transformations. Separately, we can show that a monoid object in the monoidal category of endofunctors is an equivalent definition, and that the composition of an adjoint pair of functors leads to monads, and so on.

The module structure is a mess, I realize. A lot of the parametrized modules should not be. Naming of things in general could also be made cleaner, but I've been more interested in definitions and proofs so far.

A lot of this is based on http://web.student.chalmers.se/~stevan/ctfp/html/README.html, but with some design changes that I thought were necessary. It's still very much a work in progress.

Other parts (mostly produts) are borrowed from Dan Doel

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].