mstewartgallus / prologish
☆12Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for prologish
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- ICFP tutorial☆40Updated 3 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- NbE course @ Chalmers☆28Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Existential type.☆36Updated 6 months ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- Efficient parser combinators for Haskell☆39Updated 7 months ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- ☆47Updated last month
- Generic functions for single-sorted first-order structural unification☆41Updated this week
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago