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
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- ☆47Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- xmonad in Coq☆46Updated 13 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Web based opetopic editor☆35Updated 11 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Some tools for provability logic☆37Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- ☆32Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago