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
  ☆119Updated last month
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆29Updated 5 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆144Updated 2 weeks ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• stefan-hoeck / idris2-elab-util
  Utilities and documentation for exploring idirs2's new elaborator reflection.
  ☆82Updated 5 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆112Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆128Updated 2 years ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆39Updated 3 years ago
• paulcadman / the-little-typer
  Resources for "The Little Typer" study group
  ☆47Updated 5 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆100Updated 9 months ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆94Updated 4 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆83Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆189Updated 7 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated last week
• ilya-klyuchnikov / lambdapi
  Dependently Typed Lambda Calculus in Haskell
  ☆115Updated 4 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆57Updated 6 years ago
• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆130Updated last year
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆58Updated last week
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 5 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• agda / agda-language-server
  Language Server for Agda
  ☆112Updated 7 months ago