wouter-swierstra / BrainfuckLinks
A Brainfuck interpreter written in Agda
☆52Updated 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☆82Updated last month
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 3 months ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 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 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Formalizing nbe in agda☆32Updated 12 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆37Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 11 months ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago