evertedsphere / shorshe
freshly-fermented, dependently-typed mustard, with a substructural aftertaste
☆31Updated 5 years ago
Alternatives and similar repositories for shorshe:
Users that are interested in shorshe are comparing it to the libraries listed below
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Example row-polymorphism implementations☆61Updated last year
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Simplified Observational Type Theory☆81Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- ☆39Updated 7 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago