reynir / Brainfuck
Brainfuck formalized in Coq
☆26Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for Brainfuck
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- A clean implementation of Parsing with Zippers.☆37Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- OCaml backend for Agda☆39Updated 6 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Session types in Idris2!☆27Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Experimental functional language☆18Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- OCaml with typed algebraic effects☆48Updated 6 years ago
- 🦠 Reusable components based on algebraic effects☆48Updated last month
- A library of splittable pseudo-random number generators for OCaml☆34Updated 7 months ago
- Hanoi tower in Coq☆24Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Fωμ type checker and compiler☆51Updated last year
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A repository of MetaOCaml packages☆12Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆36Updated 2 years ago
- ᚛ A type of divination employed in attempts to locate identifiers matching a given type expression☆34Updated this week