reynir / BrainfuckLinks
Brainfuck formalized in Coq
☆28Updated 3 years ago
Alternatives and similar repositories for Brainfuck
Users that are interested in Brainfuck are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- OCaml backend for Agda☆40Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 5 years ago
- ☆14Updated 4 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- 🌳 Generate a fresh bonsai in your terminal☆28Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Efficient binder representation in OCaml☆43Updated last year
- A formalization of System Fω in Agda☆19Updated 7 months ago
- IO for Gallina☆33Updated 3 months ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago