Alternatives and similar repositories for the-little-typer-exercises

Users that are interested in the-little-typer-exercises are comparing it to the libraries listed below

• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆119Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• agda / agda-language-server
  Language Server for Agda
  ☆115Updated this week
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated 3 months ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆113Updated 2 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆83Updated last month
• paulcadman / the-little-typer
  Resources for "The Little Typer" study group
  ☆48Updated 5 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated this week
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆29Updated 6 years ago
• frex-project / idris-frex
  ☆48Updated last month
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated this week
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆32Updated 2 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 months ago
• gelisam / klister
  an implementation of stuck macros
  ☆145Updated last week
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆192Updated 8 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated last month
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆133Updated 2 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated 2 months ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 7 months ago
• Lysxia / advent-of-coq-2021
  ☆44Updated 3 years ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆40Updated 3 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆104Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆102Updated 2 months ago