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
Sorting:
- ICFP tutorial☆39Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated last week
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- The Prettiest Printer☆34Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- MetaML and MetaOCaml bibliography☆89Updated 5 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Compositional type checking for Haskell☆37Updated 14 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago