Alternatives and similar repositories for language-report

Users that are interested in language-report are comparing it to the libraries listed below

• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago
• ollef / dependent-hashmap
  Dependent hash maps
  ☆14Updated last month
• 5outh / Molecule
  A tiny statically typed programming language
  ☆18Updated 10 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• inanna-malick / mononoke
  Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …
  ☆3Updated 3 years ago
• aherrmann / simply_llvm
  ☆41Updated 7 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 7 years ago
• minad / persist
  Minimal binary serialization library with focus on performance
  ☆17Updated 4 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 9 years ago
• gergoerdi / icfp-bingo-2017-idris
  ICFP Bingo 2017 (Idris edition)
  ☆30Updated 5 years ago
• mniip / yoctoparsec
  A truly tiny monadic parsing library
  ☆28Updated 4 years ago
• deech / LeftPad
  ☆23Updated 7 years ago
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆14Updated 7 years ago
• vmchale / recursion
  Recursion schemes in ATS
  ☆9Updated 3 years ago
• idris-hackers / idris-posix
  System POSIX bindings for Idris.
  ☆36Updated 6 years ago
• kowainik / treap
  Efficient implementation of the implicit treap data structure
  ☆62Updated 3 years ago
• ku-fpg / data-reify
  Reification of data structures using observable sharing
  ☆29Updated 7 months ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated last year
• bobatkey / foveran
  A Dependently Typed Programming Language
  ☆27Updated 4 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• fsestini / tt-in-cubical
  Type Theory in Type Theory using Cubical Agda
  ☆13Updated 6 years ago
• cocreature / nanovg-hs
  NanoVG Haskell bindings
  ☆22Updated 2 years ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated 5 months ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• ekmett / rounded
  MPFR bindings for Haskell
  ☆34Updated last year