Alternatives and similar repositories for CS316-2020

Users that are interested in CS316-2020 are comparing it to the libraries listed below

• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆36Updated 8 years ago
• frex-project / idris-frex
  ☆50Updated 2 months ago
• dpiponi / provability
  Some tools for provability logic
  ☆37Updated 7 years ago
• dlicata335 / hott-agda
  ☆84Updated 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 4 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆60Updated last month
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• llelf / icfp2020-papers
  ICFP 2020 papers. Crowd-sourced
  ☆90Updated 5 years ago
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆59Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆30Updated 5 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 13 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 2 weeks ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• cedille / ial
  The Iowa Agda Library
  ☆49Updated last month
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆38Updated 5 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆47Updated 6 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago