Alternatives and similar repositories for typechecker-combinators

Users that are interested in typechecker-combinators are comparing it to the libraries listed below

• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 3 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 4 months ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆34Updated last month
• decrn / tilogics
  Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.
  ☆10Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 11 months ago
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆22Updated last year
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 5 months ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• phijor / agda-mode-ng
  Let's rethink how we interact with Agda
  ☆18Updated 2 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated last month
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆22Updated 3 years ago
• ericfinster / catt.io
  Revised Omega-categorical Typechecker
  ☆27Updated 10 months ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆28Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago