tlively / BrainCoqulusLinks
A formally verified compiler of untyped lambda calculus to brainfuck
☆13Updated 7 years ago
Alternatives and similar repositories for BrainCoqulus
Users that are interested in BrainCoqulus are comparing it to the libraries listed below
Sorting:
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 8 months ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A parser for ANSI C, in Lean4.☆20Updated last year
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- Linearizability Hoare Logic☆14Updated 3 months ago
- Gallina to Bedrock2 compilation toolkit☆57Updated last week
- ☆17Updated last year
- Lean type-checker written in Scala.☆36Updated 3 years ago
- A toy dependent typed language.☆30Updated this week
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆52Updated this week
- Anders: Cubical Type Checker☆23Updated last year
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- dependent type theory experiment☆26Updated last year
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- ☆36Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- A formalization of System Fω in Agda☆17Updated 4 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- SPSC: A Small Positive Supercompiler☆37Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆73Updated 8 years ago