Alternatives and similar repositories for schmitty

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

• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆101Updated 2 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 7 months ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆128Updated 8 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated 2 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• mikeshulman / catlog
  Categorical logic from a categorical point of view
  ☆78Updated last year
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆82Updated 8 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆44Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆80Updated 4 years ago
• felixwellen / DCHoTT-Agda
  Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality
  ☆53Updated 2 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• snu-sf / paco
  A Coq library for parametric coinduction
  ☆49Updated 3 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 9 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 7 months ago
• bch29 / agda-holes
  Agda programming with holes
  ☆27Updated 4 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated last year