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:
- ICFP tutorial☆39Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 2 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Basics of the dependently-typed functional language Agda ^_^☆40Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆42Updated this week
- GRIN backend for Idris☆50Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- ☆49Updated 2 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Where my everyday research happens☆55Updated 2 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆37Updated last month
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago