ucsd-progsys / mistLinks
A tiny language for teaching and experimenting with Refinement Types
☆49Updated 4 years ago
Alternatives and similar repositories for mist
Users that are interested in mist are comparing it to the libraries listed below
Sorting:
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ICFP tutorial☆39Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Compositional type checking for Haskell☆38Updated 14 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
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- The Prettiest Printer☆35Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆59Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago