Alternatives and similar repositories for setoidtt:

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

• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated last year
• frex-project / idris-frex
  ☆47Updated 2 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 6 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆49Updated 3 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆53Updated 2 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆49Updated 6 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 10 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 8 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 5 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆71Updated 5 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆61Updated 2 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆48Updated 2 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated this week
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 4 months ago