Alternatives and similar repositories for sturdy

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

• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆58Updated last year
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 9 months ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago
• AndrasKovacs / SemanticsWithApplications
  Formal semantics in Agda.
  ☆16Updated 9 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years 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
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆42Updated 4 years ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated 7 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last week
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆81Updated 3 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 8 months ago
• RyanGlScott / ghc-software-foundations
  The Software Foundations book, in GHC
  ☆82Updated 5 months ago
• j-mie6 / design-patterns-for-parser-combinators
  A Really Cool Calculator written in Haskell... or is it?
  ☆43Updated 3 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 10 months ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 2 months ago
• xnning / GHC-Core-Literature-Review
  Literature review of GHC's Core language, System FC
  ☆67Updated 6 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated last month
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 9 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆69Updated 6 years ago
• slindley / effect-handlers
  ☆83Updated last year
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month