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!
  ☆98Updated 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
  ☆53Updated 2 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆126Updated 5 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 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
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆54Updated 5 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆61Updated 2 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆79Updated 3 weeks ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 9 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 6 months ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆124Updated 3 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆109Updated this week
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated last year
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆35Updated 2 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆57Updated 11 months ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated 3 weeks ago
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆74Updated 7 months ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• rocq-archive / stdlib2
  ☆38Updated last year
• jwiegley / coq-haskell
  A library for formalizing Haskell types and functions in Coq
  ☆168Updated last year