Alternatives and similar repositories for dirtt

Users that are interested in dirtt are comparing it to the libraries listed below

• mikeshulman / cohesivett
  Cohesive type theory
  ☆19Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last month
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆54Updated 8 years ago
• CHTT-s18 / lecture-notes
  ☆27Updated 5 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• ericfinster / catt
  Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories
  ☆16Updated 8 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆27Updated 10 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated last month
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆19Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• maxsnew / virtual-equipments
  Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory
  ☆32Updated 2 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 2 months ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• mietek / research
  Work in progress
  ☆37Updated last month
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 8 months ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 9 months ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• ericfinster / catt.io
  Revised Omega-categorical Typechecker
  ☆27Updated 9 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago