Alternatives and similar repositories for pure

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

• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆55Updated 6 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆86Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆29Updated 3 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 11 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated 2 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated last month
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 3 weeks ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆33Updated 4 years ago
• favonia / hdtt2020-notes
  ☆38Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• frex-project / idris-frex
  ☆52Updated 5 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 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.
  ☆82Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years 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