ucsd-progsys / mist
A tiny language for teaching and experimenting with Refinement Types
☆47Updated 3 years ago
Alternatives and similar repositories for mist:
Users that are interested in mist are comparing it to the libraries listed below
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 13 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- The Prettiest Printer☆35Updated last year
- Example row-polymorphism implementations☆61Updated last year
- Tiny type-checker with dependent types☆76Updated 11 years ago
- MetaML and MetaOCaml bibliography☆89Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A verified compiler for a lazy functional language☆34Updated last month
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆26Updated 8 years ago