evertedsphere / shorshe
freshly-fermented, dependently-typed mustard, with a substructural aftertaste
☆31Updated 4 years ago
Related projects: ⓘ
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆45Updated last month
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- The Evolution of a Typechecker☆51Updated 5 years ago
- Example row-polymorphism implementations☆59Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Where my everyday research happens☆53Updated 3 weeks ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆28Updated last year
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- ICFP tutorial☆40Updated 3 years ago
- BDD-based implementation of Datalog☆36Updated 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
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 6 months ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- ☆39Updated last month
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- "operating system" based on the calculus of constructions☆17Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆45Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago
- Constructive Galois connections☆32Updated 6 years ago