Alternatives and similar repositories for codo-notation:

Users that are interested in codo-notation are comparing it to the libraries listed below

• SamuelSchlesinger / gaia
  An experiment in functional interface design
  ☆23Updated 8 years ago
• gelisam / conway
  Demonstrating comonad transformers.
  ☆37Updated 8 years ago
• Gabriella439 / Haskell-Total-Library
  Exhaustive pattern matching using lenses, traversals, and prisms
  ☆32Updated 2 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆32Updated 3 years ago
• dmwit / universe
  Classes for types where we know all the values
  ☆39Updated 3 months ago
• glguy / generic-traverse
  Demonstration for how to build "traverse" using GHC.Generics efficiently
  ☆22Updated 6 years ago
• chpatrick / codec
  Easy bidirectional serialization in Haskell
  ☆50Updated 6 years ago
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 5 years ago
• thalerjonathan / gloss-idris
  A port of the gloss library from Haskell to Idris
  ☆22Updated 6 years ago
• nfrisby / coxswain
  A GHC type checker plugin for row types
  ☆39Updated 7 years ago
• atzeus / type-aligned
  Various type-aligned sequence data structures.
  ☆20Updated 3 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• laurmcarter / type-combinators
  Type level lists, pairs, sums, their operations, and their properties.
  ☆24Updated 6 years ago
• frerich / catamorphism
  A package exposing a function for generating catamorphisms.
  ☆28Updated 6 years ago
• phadej / kleene
  Kleene algebra, regular expressions
  ☆32Updated last year
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• sjoerdvisscher / free-functors
  Provides free functors that are adjoint to functors that forget class constraints.
  ☆29Updated 7 months ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 3 months ago
• AndrasKovacs / flat-maybe
  Rust-style strict Maybe in Haskell: no space/indirection overhead.
  ☆18Updated last year
• sellout / dhall-dhall
  Implementation of Dhall in Dhall
  ☆12Updated 4 months ago
• well-typed / recover-rtti
  Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).
  ☆35Updated last month
• bgamari / monoidal-containers
  Maps using values' monoidal structure during merging
  ☆42Updated last week
• sellout / dredd
  Automatic type class law checking.
  ☆24Updated 2 months ago
• jwiegley / categorical
  Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work
  ☆19Updated 7 years ago
• kcsongor / typelevel-prelude
  Standard module for type-level programming in Haskell
  ☆31Updated 5 years ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆35Updated 3 years ago
• byorgey / type-matrices
  Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff
  ☆13Updated 7 years ago
• lambdageek / freer-church
  Church-encoding of the Freer monad
  ☆28Updated 8 years ago