wouter-swierstra / BrainfuckLinks
A Brainfuck interpreter written in Agda
☆50Updated 4 years ago
Alternatives and similar repositories for Brainfuck
Users that are interested in Brainfuck are comparing it to the libraries listed below
Sorting:
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- A nano "theorem prover".☆62Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Where my everyday research happens☆55Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 2 months ago
- A formalization of M-types in Agda☆34Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago