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
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆58Updated 7 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 5 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆62Updated 3 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆82Updated 8 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆127Updated 8 months ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 8 months ago
• mikeshulman / catlog
  Categorical logic from a categorical point of view
  ☆78Updated last year
• rocq-community / corn
  Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
  ☆114Updated 2 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆93Updated 7 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆81Updated 2 months ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆56Updated last year
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆50Updated 8 months ago
• rocq-archive / stdlib2
  ☆38Updated last year
• bch29 / agda-holes
  Agda programming with holes
  ☆27Updated 4 years ago