Alternatives and similar repositories for pure

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

• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 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
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• alhassy / AgdaCheatSheet
  Basics of the dependently-typed functional language Agda ^_^
  ☆40Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 6 years ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆55Updated 4 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated 2 weeks ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 4 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• frex-project / idris-frex
  ☆51Updated 3 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated last week
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 4 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 4 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated last month
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago