Alternatives and similar repositories for sott

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

• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆114Updated 5 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆54Updated 2 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• slindley / effect-handlers
  ☆86Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• RedPRL / sml-typed-abts
  second-order abstract syntax
  ☆31Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 5 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 5 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆34Updated 8 years ago
• frex-project / idris-frex
  ☆48Updated last week
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆53Updated 8 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 3 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆46Updated 6 years ago
• gallais / type-scope-semantics
  A self-contained repository for the paper Type and Scope Preserving Semantics
  ☆23Updated 6 years ago