kindelia-archive / LambdaVM
A next-gen, massively parallel, beta-optimal functional runtime.
☆10Updated 3 years ago
Alternatives and similar repositories for LambdaVM:
Users that are interested in LambdaVM are comparing it to the libraries listed below
- Absal ex☆56Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A modern proof language☆8Updated 3 years ago
- ☆35Updated 6 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- ☆36Updated 3 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Specification of the Formality proof and programming language☆41Updated last year
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Kempe is a compiled stack-based language☆58Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- GPU-based interaction nets evaluator☆15Updated 13 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- A minimal pure functional language based on self dependent types.☆72Updated 2 years ago
- Yoneda lemma in every known language☆17Updated last year