Mesabloo / jellyvmLinks
A VM written following the Linear Abstract Machine architecture
☆22Updated 6 years ago
Alternatives and similar repositories for jellyvm
Users that are interested in jellyvm are comparing it to the libraries listed below
Sorting:
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Linear algebra formalization in Agda☆16Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- ☆39Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- ICFP tutorial☆39Updated 4 years ago
- Strict Haskell-like programming language that compiles to LLVM☆71Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- an experiment in presenting code.☆14Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A two-dimensional parser combinator library.☆41Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- A simple, easily embeddable pure-functional language with static typing and row polymorphism.☆10Updated 10 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- Efficient parser combinators for Haskell☆39Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Zippers for cofree types☆13Updated 4 years ago