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 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- ICFP tutorial☆39Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- A usable type system for call by push-value☆33Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 weeks ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Where my everyday research happens☆55Updated this week
- ☆51Updated 4 months ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- The Prettiest Printer☆35Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- ☆33Updated 2 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year