Alternatives and similar repositories for pure

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

• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆31Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 2 weeks 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 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• frex-project / idris-frex
  ☆48Updated 2 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated 3 weeks ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 10 months ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 5 months ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 10 months ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated this week
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago