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
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆73Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• slindley / effect-handlers
  ☆84Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆32Updated 13 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆61Updated 6 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 4 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 2 weeks ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 4 months ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 3 years ago
• RedPRL / sml-typed-abts
  second-order abstract syntax
  ☆31Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 5 months ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆54Updated 8 years ago
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 7 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆26Updated 9 years ago
• Saizan / cubical-demo
  ☆45Updated 6 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆71Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆126Updated last year
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated last month