tlively / BrainCoqulusLinks
A formally verified compiler of untyped lambda calculus to brainfuck
☆16Updated 8 years ago
Alternatives and similar repositories for BrainCoqulus
Users that are interested in BrainCoqulus are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- ☆16Updated 3 years ago
- Linearizability Hoare Logic☆14Updated 9 months ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- dependent type theory experiment☆26Updated last year
- A formalization of System Fω in Agda☆20Updated 2 weeks ago
- A toy dependent typed language.☆36Updated this week
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- A minimal esolang based on lambda calculus☆16Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Interactive holes for Lean 4☆22Updated last year
- Reference compiler for c0☆39Updated last month
- ☆17Updated last year
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Updated 5 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Updated 10 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆39Updated 8 months ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆11Updated last month
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 5 years ago
- My Agda blog/lab/playground☆12Updated 3 weeks ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 7 years ago
- A Gallina compiler with C++17 as an intermediate representation☆43Updated 4 years ago