Alternatives and similar repositories for yacctt

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

• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• gallais / idris-tparsec
  TParsec - Total Parser Combinators in Idris
  ☆95Updated last year
• 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
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated 11 months ago
• valis / hoq
  A language based on homotopy type theory with an interval
  ☆83Updated 10 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆83Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• llelf / icfp2020-papers
  ICFP 2020 papers. Crowd-sourced
  ☆91Updated 4 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆53Updated 8 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆129Updated 10 months ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 6 years ago
• andrejbauer / what-is-algebraic-about-algebraic-effects
  ☆46Updated 6 years ago
• dlicata335 / cart-cube
  Cartesian Cubical Type Theory
  ☆71Updated 4 years ago