langston-barrett / write-yourself-a-scheme-in-agdaLinks
Like "Write Yourself a Scheme in 48 Hours", but in Agda
☆51Updated 7 years ago
Alternatives and similar repositories for write-yourself-a-scheme-in-agda
Users that are interested in write-yourself-a-scheme-in-agda are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Agda-style equational reasoning in Haskell☆54Updated 7 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- Compositional type checking for Haskell☆37Updated 14 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Web based opetopic editor☆35Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A usable type system for call by push-value☆33Updated 5 years ago