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:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- ICFP tutorial☆39Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 2 months ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- ☆47Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Build system☆131Updated 2 weeks ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 5 months ago