vmchale / kempe
Kempe is a compiled stack-based language
☆58Updated 5 months ago
Alternatives and similar repositories for kempe:
Users that are interested in kempe are comparing it to the libraries listed below
- A pure type system implemented in OCaml☆78Updated 4 years ago
- a self-hosting lambda calculus compiler☆35Updated 3 years ago
- a functional programming language with algebraic effects and handlers☆81Updated last month
- source code for the bondi programming language☆40Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- small programming language. pls be gentle.☆39Updated 2 months ago
- Pretty-print error messages of the ATS Compiler☆33Updated 5 years ago
- Macro Lambda Calculus☆48Updated 6 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆59Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A simple functional programming language.☆21Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- A prototype programming language for programming with runners☆89Updated 3 years ago