ekmett / linear-logicLinks
They see me rollin'. They're Heyting. -- Chamillionaire, 2005
☆83Updated 4 years ago
Alternatives and similar repositories for linear-logic
Users that are interested in linear-logic are comparing it to the libraries listed below
Sorting:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Reimplementation of Parsley in Haskell, with improvements☆60Updated last month
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- First-class type families☆90Updated last month
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 11 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Comparing Haskell effect systems for ergonomics and speed☆67Updated 4 years ago
- Haskell embedding of PlusCal☆62Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Efficient Haskell effect handlers based on evidence translation.☆85Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated 3 months ago
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- Interpreter for GHC Haskell☆22Updated 6 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- type level sets☆67Updated 6 years ago
- A higher-order effect system where the sky's the limit☆91Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- A Haskell library for open records and variants using closed type families and type literals☆112Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Where my everyday research happens☆55Updated last month
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆81Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- JHC Haskell compiler split into reusable components☆57Updated 7 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated 5 months ago
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆97Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- ☆26Updated 3 years ago