reynir / Brainfuck
Brainfuck formalized in Coq
☆26Updated 2 years ago
Alternatives and similar repositories for Brainfuck:
Users that are interested in Brainfuck are comparing it to the libraries listed below
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- 🦠 Reusable components based on algebraic effects☆48Updated 4 months ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆44Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated last year
- Session types in Idris2!☆27Updated 4 years ago
- Hanoi tower in Coq☆24Updated last month
- 👹 A library for hierarchical names and lexical scoping☆25Updated 4 months ago
- OCaml backend for Agda☆39Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Experimental functional language☆18Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- OCaml with typed algebraic effects☆49Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- A dependently typed type checker for a TT with intervals☆22Updated 4 years ago
- Efficient binder representation in OCaml☆39Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Ropes ("heavyweight strings") for OCaml☆49Updated 6 months ago
- Formalising session types in Coq☆17Updated 5 years ago