langston-barrett / write-yourself-a-scheme-in-agdaLinks
Like "Write Yourself a Scheme in 48 Hours", but in Agda
☆52Updated 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:
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- being an experiment with potato power☆23Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆30Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- ☆23Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 3 weeks ago
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 7 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 3 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago