Alternatives and similar repositories for agda-categories:

Users that are interested in agda-categories are comparing it to the libraries listed below

• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 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
• flupe / generics
  ☆23Updated 8 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• brunofx86 / LL
  Formalization of Linear Logic
  ☆10Updated 7 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• effectfully / random-stuff
  ☆19Updated 7 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆26Updated 9 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 5 months ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• pigworker / Gigs-Summer-2018
  what I did on my holidays
  ☆12Updated 6 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• diagrams / geometry
  Haskell geometry library
  ☆17Updated 5 years ago