Alternatives and similar repositories for anders

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

• edwinb / SPLV20
  SPLV20 course notes
  ☆114Updated 3 years ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆75Updated 3 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆84Updated 4 months ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 10 months ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 6 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 7 months ago
• gelisam / klister
  an implementation of stuck macros
  ☆149Updated 2 weeks ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 5 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆120Updated 3 years ago
• sequents / code
  Proof theory seminar
  ☆36Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆213Updated 3 years ago
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆143Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆76Updated 7 years ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆116Updated 4 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆134Updated last year
• luc-tielen / llvm-codegen
  LLVM code generation in Haskell
  ☆54Updated last year
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆85Updated 4 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• ucsd-progsys / liquid-fixpoint
  Horn Clause Constraint Solving for Liquid Types
  ☆155Updated last week
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• edwinb / idris2-vim
  Vim mode for Idris 2
  ☆78Updated 3 years ago