Alternatives and similar repositories for pure

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

• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆64Updated 8 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆102Updated 5 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated 3 months ago
• gelisam / klister
  an implementation of stuck macros
  ☆146Updated 3 weeks ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• ollef / rock
  Build system
  ☆128Updated 2 years ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆143Updated 6 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 2 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 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 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated 8 months ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆32Updated 4 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆55Updated 4 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 8 months ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 8 months ago
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆43Updated last year
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆94Updated 10 months ago