wouter-swierstra / Brainfuck
A Brainfuck interpreter written in Agda
☆50Updated 3 years ago
Alternatives and similar repositories for Brainfuck:
Users that are interested in Brainfuck are comparing it to the libraries listed below
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆52Updated last week
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Agda programming with holes☆27Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- The multimode presheaf proof-assistant☆36Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 3 months ago
- Work in progress☆34Updated last month
- ☆38Updated 5 months ago