ucsd-progsys / mistLinks
A tiny language for teaching and experimenting with Refinement Types
☆47Updated 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☆49Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 6 years ago
- ICFP tutorial☆39Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Where my everyday research happens☆54Updated 2 months ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- A nano "theorem prover".☆62Updated 6 years ago
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago