thamugadi / mltt-cLinks
Martin-Löf type theory + W-types implemented in C (WIP)
☆18Updated 2 months ago
Alternatives and similar repositories for mltt-c
Users that are interested in mltt-c are comparing it to the libraries listed below
Sorting:
- Linearizability Hoare Logic☆14Updated 3 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- File format and optimizer for programs encoded in binary lambda calculus☆15Updated last year
- A toy dependent typed language.☆30Updated this week
- ☆17Updated last year
- Journey to the Center of the Lambda Calculus☆14Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- An implementation of interaction nets as a forth-like language.☆34Updated 2 months ago
- ☆16Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Experiments with Cubical Agda☆11Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- dependent type theory experiment☆26Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A minimal esolang based on lambda calculus☆16Updated 4 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A formally verified compiler of untyped lambda calculus to brainfuck☆13Updated 7 years ago
- A formalization of System Fω in Agda☆17Updated 4 months ago
- A verified, modern, hardened memory allocator. [maintainer=@cmovcc]☆29Updated this week
- ☆19Updated 3 years ago