JimmyZJX / TypingFormalization
☆14Updated 5 years ago
Alternatives and similar repositories for TypingFormalization:
Users that are interested in TypingFormalization are comparing it to the libraries listed below
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- higher-kinded data☆30Updated last year
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- A talk☆28Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- bidirectional type checking algorithms for higher-ranked polymorphism☆19Updated 3 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago
- ICFP tutorial☆39Updated 3 years ago
- ☆18Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Category theory formalized in cubical agda☆20Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Dual Traversable☆42Updated last year
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Experiments with linear types☆14Updated 7 years ago
- Fast higher-order effect handlers with evidence passing☆20Updated last year