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).
  ☆57Updated 11 months ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆53Updated 2 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 5 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• 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
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆54Updated 5 months ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 4 months ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 6 years ago
• Tritlo / PropR
  Genetic program repair using GHC
  ☆30Updated 9 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• plclub / hs-to-coq
  Convert Haskell source code to Coq source code.
  ☆82Updated 5 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆53Updated 2 weeks ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆56Updated last year
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆49Updated 5 months ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 10 years ago
• bluerock-io / BRiCk
  Formalization of C++ for verification purposes.
  ☆74Updated this week
• flupe / generics
  ☆23Updated 7 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆44Updated 2 months ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆30Updated 3 months ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 3 months ago