Alternatives and similar repositories for pure

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

• 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 3 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• frex-project / idris-frex
  ☆51Updated 3 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆59Updated last week
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆61Updated 6 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 8 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• favonia / hdtt2020-notes
  ☆36Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 4 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆58Updated this week
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 3 months ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 6 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆67Updated last week
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 3 months ago