Alternatives and similar repositories for charm

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

• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 7 months ago
• evincarofautumn / Toody
  A two-dimensional parser combinator library.
  ☆41Updated 8 years ago
• norm2782 / NanoProlog
  ☆17Updated 2 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 8 months ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• TOTBWF / iso
  A reversible language
  ☆22Updated 6 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• cocreature / nanovg-hs
  NanoVG Haskell bindings
  ☆22Updated 2 years ago
• TikhonJelvis / Simple-Prolog
  A simple Prolog interpreter
  ☆42Updated 3 years ago
• blamario / incremental-parser
  Haskell parsing combinator liibrary that can be fed the input and emit the parsed output incrementally
  ☆23Updated 2 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• e-wrks / edh
  Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++
  ☆28Updated last year
• danieljharvey / horses
  small programming language. pls be gentle.
  ☆39Updated 2 months ago
• wilbowma / pl-thesaurus
  ☆90Updated 3 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 3 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• tyehle / llvm-lambda
  A compiler for a simple language using llvm
  ☆35Updated 2 years ago
• stefan-hoeck / idris2-tailrec
  Provably total, tail-call optimized monadic recursion in Idris2
  ☆14Updated last year
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• eayus / sirdi
  Package manager for Idris
  ☆36Updated 2 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated 3 weeks ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• isovector / nimic
  a language about nothing
  ☆19Updated 5 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago