jpaykin / LNLHaskellLinks
Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic
☆36Updated 7 years ago
Alternatives and similar repositories for LNLHaskell
Users that are interested in LNLHaskell are comparing it to the libraries listed below
Sorting:
- Implementing grep in Agda☆33Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- ☆31Updated 11 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A tool for formally verifying Haskell code in Agda☆28Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Where my everyday research happens☆56Updated this week
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- ☆45Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Category theory and algebra☆27Updated 9 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated 2 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- A simple GUI for Agda☆31Updated 10 years ago