wouter-swierstra / Brainfuck
A Brainfuck interpreter written in Agda
☆49Updated 3 years ago
Alternatives and similar repositories for Brainfuck:
Users that are interested in Brainfuck are comparing it to the libraries listed below
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Work in progress☆34Updated 4 months ago
- An Agda library for programming with ternary relations☆17Updated last month
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Implementing grep in Agda☆32Updated 4 years ago