Alternatives and similar repositories for TypesWhoSayNi

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

• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 2 weeks ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆50Updated last year
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆28Updated 2 weeks ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• frex-project / idris-frex
  ☆49Updated 2 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆73Updated 6 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• flupe / generics
  ☆23Updated last year
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆34Updated 4 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated last month
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 5 years ago
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆102Updated 2 months ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 4 years ago
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 9 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 7 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• gallais / type-scope-semantics
  A self-contained repository for the paper Type and Scope Preserving Semantics
  ☆23Updated 6 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago