Alternatives and similar repositories for TAPL:

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

• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆36Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 4 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• frex-project / idris-frex
  ☆47Updated 2 months ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆104Updated 2 years ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated last year
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆38Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆34Updated last year
• favonia / hdtt2020-notes
  ☆35Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆49Updated 3 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 3 months ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆19Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆27Updated 3 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.
  ☆81Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• myuon / ghc-compiler-notes
  A collection of Notes on GHC
  ☆69Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆81Updated 3 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆39Updated 4 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆38Updated 7 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last year
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated this week
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆21Updated 4 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 3 weeks ago