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).
  ☆63Updated last year
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated last year
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• AndrasKovacs / SemanticsWithApplications
  Formal semantics in Agda.
  ☆16Updated 10 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆63Updated 5 months ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated last week
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆54Updated 5 months ago
• xnning / GHC-Core-Literature-Review
  Literature review of GHC's Core language, System FC
  ☆67Updated 7 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆55Updated 6 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆36Updated 9 months ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆50Updated last year
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 5 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 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.
  ☆82Updated 4 years ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 7 years ago
• csabahruska / p4f-control-flow-analysis
  Haskell implementation of P4F Control-Flow Analysis
  ☆21Updated 3 years ago
• UlfNorell / x86-agda
  Inline, type safe X86-64 assembly programming in Agda
  ☆69Updated 6 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 4 months ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• j-mie6 / design-patterns-for-parser-combinators
  A Really Cool Calculator written in Haskell... or is it?
  ☆43Updated 4 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 7 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated last year