evertedsphere / shorshe
freshly-fermented, dependently-typed mustard, with a substructural aftertaste
☆31Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for shorshe
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- ☆39Updated 3 months ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- Inline, type safe X86-64 assembly programming in Agda☆66Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- A library for doing generic programming in Agda☆28Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆50Updated 4 years ago
- second-order abstract syntax☆31Updated 3 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- ICFP tutorial☆40Updated 3 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- BDD-based implementation of Datalog☆36Updated 4 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Where my everyday research happens☆53Updated last week
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago