evertedsphere / shorsheLinks
freshly-fermented, dependently-typed mustard, with a substructural aftertaste
☆30Updated 5 years ago
Alternatives and similar repositories for shorshe
Users that are interested in shorshe are comparing it to the libraries listed below
Sorting:
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Simplified Observational Type Theory☆87Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- ☆40Updated last year
- A prototypical dependently typed languages with sized types and variances☆115Updated last month
- ☆48Updated 6 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A prototype programming language for programming with runners☆92Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago