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 3 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 6 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 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
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 10 months ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆128Updated 10 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆129Updated 2 years ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 9 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆114Updated 3 weeks ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• Saizan / cubical-demo
  ☆45Updated 6 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• mikeshulman / catlog
  Categorical logic from a categorical point of view
  ☆79Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 8 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆124Updated 3 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆42Updated 4 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆80Updated 4 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)…
  ☆46Updated last year
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• rzrn / ground_zero
  Ground Zero: Lean 4 HoTT Library
  ☆62Updated 2 weeks ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 10 months ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆81Updated 4 months ago