Alternatives and similar repositories for anders

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

• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated 2 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆113Updated 2 years ago
• dpndnt / library
  Library of the ##dependent distributed research support group
  ☆117Updated last year
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 3 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆96Updated 8 months ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆191Updated 8 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆75Updated 7 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆146Updated last month
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆119Updated 3 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 5 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 2 months ago
• scott-fleischman / agda-from-nothing
  A workshop on learning Agda with minimal prerequisites.
  ☆85Updated 9 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 3 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 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
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 5 months ago
• sequents / code
  Proof theory seminar
  ☆36Updated 4 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆133Updated last year
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 weeks ago
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 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
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 3 months ago
• stefan-hoeck / idris2-hedgehog
  An Idris port of the Haskell Hedghog library
  ☆35Updated 2 months ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆60Updated last month