curry-packages / pflpLinks
Probabilistic Functional Logic Programming
☆16Updated 4 months ago
Alternatives and similar repositories for pflp
Users that are interested in pflp are comparing it to the libraries listed below
Sorting:
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆33Updated 3 weeks ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Classical Logic in Haskell☆24Updated 5 months ago
- Combinators for manipulating dependently-typed predicates.☆12Updated last year
- Funny little Haskell impl☆18Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Icicle Streaming Query Language☆28Updated 2 weeks ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Implementation of an efficient thread-safe global Symbol Table, with garbage collection☆19Updated 5 months ago
- classical sequent calculus, embedded in Haskell☆21Updated 3 years ago
- ☆23Updated last year
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 7 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated 3 months ago