Alternatives and similar repositories for pure

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

• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 4 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated 2 weeks ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆94Updated 4 months ago
• ollef / rock
  Build system
  ☆123Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last month
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 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.
  ☆81Updated 3 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆141Updated 6 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆73Updated 2 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 9 months ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆30Updated 2 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 4 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago