Alternatives and similar repositories for ttstar

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

• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• habit-lang / alb
  ☆39Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 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
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• csgordon / cayenne
  Resurrecting Lennart Augustsson's implementation of Cayenne
  ☆37Updated 12 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆46Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 11 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 weeks ago
• bitonic / tog
  ☆26Updated 8 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• Beluga-lang / Meta
  Mechanizing Types and Programming Languages using Beluga
  ☆21Updated 5 years ago
• agda / agda-spec
  Specification of Agda.
  ☆25Updated 6 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• LightAndLight / sized-hkts
  Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
  ☆51Updated 9 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 4 months ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago