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:
- Gallina to Bedrock2 compilation toolkit☆54Updated this week
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- racket llvm C-API bindings☆17Updated 5 months ago
- An equational theorem prover based on Knuth-Bendix completion☆52Updated 2 months ago
- Racket bindings for Z3☆24Updated 6 years ago
- Brainfuck formalized in Coq☆26Updated 3 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- The Mechanization of Standard ML☆73Updated 2 years ago
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Category Theory in Programming☆12Updated last month
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Experiments about intermediate representations in compilers☆25Updated 12 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- ☆55Updated 2 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Benchmark repository of polyglot effect handler examples☆24Updated last month
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 6 months ago
- Anders: Cubical Type Checker☆24Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Abstracting Definitional Interpreters☆68Updated 7 years ago