langston-barrett / write-yourself-a-scheme-in-agda
Like "Write Yourself a Scheme in 48 Hours", but in Agda
☆51Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for write-yourself-a-scheme-in-agda
- ☆28Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- being an experiment with potato power☆23Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- A general purpose programming language with linear types☆44Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- ☆23Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- System POSIX bindings for Idris.☆36Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago