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 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
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- ☆17Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- ☆22Updated 5 years ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Linearizability Hoare Logic☆14Updated 2 months ago
- Experimental functional language☆17Updated 2 years ago
- Mary is the successor of Marx, a content delivery and assessment engine based on markdown and git☆17Updated last year
- A constraint solver built from scratch in OCaml☆11Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- A formalization of System Fω in Agda☆17Updated 4 months ago
- Stack-based esoteric programming language☆18Updated 4 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 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
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated last week
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 3 weeks ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated last month
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Like the Programming Languages Zoo but with esoteric languages.☆25Updated 5 years ago