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 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- MetaML and MetaOCaml bibliography☆89Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Session types in Idris2!☆27Updated 4 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
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- ICFP tutorial☆39Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Example row-polymorphism implementations☆61Updated last year
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month