Alternatives and similar repositories for causal-commutative-arrows-revisited:

Users that are interested in causal-commutative-arrows-revisited are comparing it to the libraries listed below

• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆10Updated 8 years ago
• rlepigre / subml
  SubML (prototype) language
  ☆23Updated 2 years ago
• gereeter / bounded-intmap
  A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.
  ☆20Updated last year
• roglo / banach_tarski
  Formal proof in Coq of Banach-Tarski paradox.
  ☆15Updated 4 months ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 6 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• jespercockx / cubes
  An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…
  ☆12Updated 8 years ago
• sinelaw / fresh
  ☆14Updated 7 years ago
• deepfire / nh
  Manage Nix Haskell override sets
  ☆11Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 9 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• osa1 / StrictCore
  An experimental intermediate language for GHC
  ☆36Updated 7 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆28Updated 3 years ago
• oisdk / monus-weighted-search
  Efficient search weighted by an ordered monoid with monus.
  ☆16Updated 2 years ago
• Lysxia / generic-recursion-schemes
  Folds for recursive types with GHC Generics
  ☆26Updated 4 years ago
• bartavelle / stateWriter
  A RWS like monad without the slow writer stuff
  ☆12Updated last year
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• edwinb / ConcIO
  Concurrent IO language with Uniqueness Types
  ☆9Updated 9 years ago
• typeclasses / partial-semigroup
  A partial binary associative operator (appendMaybe :: a → a → Maybe a)
  ☆13Updated 3 months ago
• system-f / papa
  Reasonable Haskell default import
  ☆27Updated 2 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated last month
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• ziman / idris-ocaml
  OCaml back end for Idris
  ☆22Updated 7 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• jmars / Records
  Dependently Typed Extensible Records with Prototypal Inheritance
  ☆9Updated 9 years ago