ucsd-progsys / mistLinks
A tiny language for teaching and experimenting with Refinement Types
☆48Updated 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
- IO using sized types and copatterns☆35Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- ICFP tutorial☆39Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Where my everyday research happens☆55Updated 3 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago