basic-calculus / prologishLinks
☆12Updated 5 years ago
Alternatives and similar repositories for prologish
Users that are interested in prologish are comparing it to the libraries listed below
Sorting:
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- ICFP tutorial☆39Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- Haskell library for doing category theory with a central role for profunctors☆24Updated last week
- First class patterns and pattern matching, using type families☆17Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- ☆24Updated 4 months ago
- Where my everyday research happens☆55Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- ☆51Updated 3 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A priliminary backend for Idris that compiles to Clean.☆15Updated 8 years ago