reynir / Brainfuck
Brainfuck formalized in Coq
β26Updated 3 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
- π¦ Reusable components based on algebraic effectsβ49Updated 6 months ago
- HardCaml implementation of the OCaml ZINC Abstract Machineβ44Updated 5 years ago
- Monad-based linear types in OCaml, with a few syntax extensionsβ37Updated 5 years ago
- A clean implementation of Parsing with Zippers.β37Updated 6 years ago
- IO using sized types and copatternsβ33Updated 3 years ago
- πΉ A library for hierarchical names and lexical scopingβ25Updated 6 months ago
- Experimental type-checker for internally parametric type theoryβ32Updated last week
- A simple implementation of linear type theoryβ38Updated 7 years ago
- OCaml with typed algebraic effectsβ49Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modulesβ31Updated 2 years ago
- LL(1) parser generator verified in Coqβ46Updated 5 years ago
- Ropes ("heavyweight strings") for OCamlβ49Updated 8 months ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.β37Updated 2 years ago
- A bare-bones LCF-style proof assistantβ22Updated 5 years ago
- Delimited continuations in byte-code and native OCamlβ27Updated 4 years ago
- being an implementation of the calculus of constructionsβ15Updated 2 years ago
- πͺ A Staged Type Theoryβ35Updated last year
- a version of the 2048 game for Coqβ22Updated last year
- Implementation of sprintf for Coqβ18Updated 4 years ago
- A formalization of System FΟ in Agdaβ16Updated last month
- multi-shot continuations in OCamlβ48Updated last month
- Toy implementation of Martin-LΓΆf Type Theoryβ28Updated 2 years ago
- Organize mathematical thoughtsβ20Updated last year
- Haskell implementation of the Edinburgh Logical Frameworkβ27Updated 5 months ago
- α A type of divination employed in attempts to locate identifiers matching a given type expressionβ34Updated last month
- Efficient binder representation in OCamlβ40Updated 8 months ago
- flexible 'let rec' generation for MetaOCamlβ26Updated last year
- π³ Generate a fresh bonsai in your terminalβ24Updated 3 years ago
- Choice operator in OCaml, providing a backtracking monadβ25Updated 3 years ago