4y8 / ski-in-asmLinks
A SKI combinators interpreter written in assembly
☆20Updated 4 years ago
Alternatives and similar repositories for ski-in-asm
Users that are interested in ski-in-asm are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Linearizability Hoare Logic☆14Updated 3 months ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- ☆17Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆19Updated 4 months ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- File format and optimizer for programs encoded in binary lambda calculus☆15Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆58Updated last month
- Normalization for Gödel's system T using a glueing model construction☆9Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- ☆12Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Organize mathematical thoughts☆20Updated last year
- Specification of the Cedille Core language☆31Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago