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☆49Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- ICFP tutorial☆39Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 4 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
- Compositional type checking for Haskell☆37Updated 14 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- ☆26Updated 8 years ago