Alternatives and similar repositories for llvm-lambda

Users that are interested in llvm-lambda are comparing it to the libraries listed below

• lortabac / ariel
  A simple, purely-functional programming language
  ☆25Updated 3 years ago
• glaebhoerl / simplecompiler
  used to be something more ambitious, cut scope to just a simple compiler for thesis project
  ☆17Updated 6 years ago
• LightAndLight / closure
  Closure calculus implementation
  ☆12Updated 6 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated last year
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 6 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• tfausak / monadoc-5
  🔖 Better Haskell documentation.
  ☆17Updated 5 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• 5outh / Molecule
  A tiny statically typed programming language
  ☆18Updated 11 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• mrkgnao / pico
  The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)
  ☆15Updated 7 years ago
• sfultong / stand-in-language
  a simple total pure functional language, eventually to have powerful static checking and optimization
  ☆33Updated last week
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• robrix / tilec
  Sometimes when I feel sad I implement a dependently typed lambda calculus.
  ☆15Updated 5 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• LightAndLight / meta-lambda
  Lambda Calculus with quote and unquote
  ☆19Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• kwanghoon / polyrpc
  PolyRPC, A multi-tier functional programming language
  ☆20Updated 3 years ago
• bts / deferred-substitution
  An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"
  ☆15Updated 7 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆38Updated 14 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated last week
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago