vmchale / kempeLinks
Kempe is a compiled stack-based language
☆58Updated 9 months ago
Alternatives and similar repositories for kempe
Users that are interested in kempe are comparing it to the libraries listed below
Sorting:
- a functional programming language with algebraic effects and handlers☆82Updated 4 months ago
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- source code for the bondi programming language☆40Updated 6 years ago
- small programming language. pls be gentle.☆39Updated this week
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A compiler for a simple language using llvm☆35Updated 2 years ago
- ☆39Updated 11 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated last year
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 5 months ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A prototype programming language for programming with runners☆90Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- language verification, construction, and analysis☆20Updated 3 years ago
- A [ functional stack ] based language.☆29Updated last year
- LaTeX sources for the Habit Programming Language Report☆24Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- SPJ's tutorial on implementing functional languages☆29Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- ICFP tutorial☆39Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- ☆47Updated 7 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago