reynir / BrainfuckLinks
Brainfuck formalized in Coq
☆31Updated 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 9 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months 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
- OCaml backend for Agda☆39Updated 7 years ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- ☆14Updated 8 months ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- Efficient binder representation in OCaml☆43Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- 🌳 Generate a fresh bonsai in your terminal☆30Updated 4 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 7 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆91Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆45Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Monad-based linear types in OCaml, with a few syntax extensions☆38Updated 6 years ago