ucsd-progsys / mistLinks
A tiny language for teaching and experimenting with Refinement Types
☆47Updated 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
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 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
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Compositional type checking for Haskell☆37Updated 14 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- Session types in Idris2!☆27Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago