JimmyZJX / TypingFormalization
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for TypingFormalization
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- higher-kinded data☆30Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Session types in Idris2!☆27Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 3 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A talk☆28Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Linear map categories in Agda☆5Updated last year
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Alternative Core language for GHC plugins☆39Updated 8 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- ☆18Updated 3 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆22Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated this week
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year