tyehle / llvm-lambdaLinks
A compiler for a simple language using llvm
☆36Updated 2 years ago
Alternatives and similar repositories for llvm-lambda
Users that are interested in llvm-lambda are comparing it to the libraries listed below
Sorting:
- A simple, purely-functional programming language☆25Updated 3 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- 🔖 Better Haskell documentation.☆17Updated 5 years ago
- ☆41Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Lambda Calculus with quote and unquote☆19Updated 5 years ago
- Closure calculus implementation☆12Updated 6 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- A tiny statically typed programming language☆18Updated 11 years ago
- A two-dimensional parser combinator library.☆41Updated 8 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- ICFP tutorial☆39Updated 4 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- Merged into ian repo: https://github.com/seagreen/ian#llvm-in-haskell☆17Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A Datalog extension to reason about time with CTL operators☆14Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- a simple total pure functional language, eventually to have powerful static checking and optimization☆33Updated last month
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- Edit is a monad for rewriting things.☆23Updated 5 years ago
- A truly tiny monadic parsing library☆28Updated 4 years ago
- Efficient parser combinators for Haskell☆39Updated 2 months ago
- A usable type system for call by push-value☆33Updated 5 years ago