NicklasBoto / BruSKILinks
"DeBruijn to SKI" Untyped language that compiles to Unlambda
☆10Updated 4 years ago
Alternatives and similar repositories for BruSKI
Users that are interested in BruSKI are comparing it to the libraries listed below
Sorting:
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- koneko - a concatenative not-quite-lisp for kittens☆24Updated 9 months ago
- Simple, elegant, profunctorial, applicative validation for product types!☆19Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 8 months ago
- A functional scripting language.☆18Updated 4 months ago
- IDE support for the functional logic programming language Curry☆31Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- ☆41Updated last year
- Bidirectional type checker for the simply typed lambda calculus☆14Updated 5 years ago
- Your happy place for learning APL☆16Updated 2 years ago
- Prototype for https://github.com/Innf107/vega☆19Updated 10 months ago
- Fast, CommonMark-compliant Markdown parser written in Racket☆32Updated 8 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 7 months ago
- Source code for haskle.net☆30Updated last year
- small programming language. pls be gentle.☆39Updated last month
- a functional programming language with algebraic effects and handlers☆82Updated 3 months ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- A pure type system implemented in OCaml☆78Updated 4 years ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆62Updated last year
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 5 months ago
- Malfunction backend for Idris 2☆12Updated 3 years ago
- An implementation of interaction nets as a forth-like language.☆33Updated last month
- A general purpose statically-typed concatenative programming language.☆54Updated 2 years ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated last year