iczelia / lc-aplLinks
Journey to the Center of the Lambda Calculus
☆14Updated 2 years ago
Alternatives and similar repositories for lc-apl
Users that are interested in lc-apl are comparing it to the libraries listed below
Sorting:
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Updated 3 months ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- File format and optimizer for programs encoded in binary lambda calculus☆17Updated last year
- WIP stack language that uses regex for control flow☆42Updated 2 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆37Updated last month
- koneko - a concatenative not-quite-lisp for kittens☆25Updated last year
- Linearizability Hoare Logic☆14Updated 8 months ago
- a self-hosting lambda calculus compiler☆37Updated 8 months ago
- The future of programming.☆69Updated 4 years ago
- Programming with pure lambda calculus☆129Updated last week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆77Updated 5 years ago
- A general purpose statically-typed concatenative programming language.☆55Updated 2 years ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆71Updated last year
- Yet another UNIX-like argument parser for C. CC0-licensed.☆19Updated 3 months ago
- Compiler for the fort programming language☆14Updated 5 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A programmable virtual CPU written in untyped lambda calculus☆58Updated 3 years ago
- A functional programming language, mirroring Erlang and Go, but with more OCaml!☆28Updated last month
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Like APL, but with emojis☆15Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- A constructive proof assistant for second order logic.☆36Updated last year
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 3 years ago
- Experiment on how to bootstrap the OCaml compiler☆111Updated 3 years ago
- A formalization of System Fω in Agda☆20Updated 9 months ago
- Interactive holes for Lean 4☆22Updated last year
- The Caml Light implementation of the Caml language☆67Updated 2 years ago
- The interpreter for Rhovas, a programming language for API design and enforcement.☆35Updated 3 months ago
- An esoteric RPN golfing language☆24Updated 3 years ago