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:
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months 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
- A nano "theorem prover".☆62Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆59Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Where my everyday research happens☆55Updated last week
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago