bolt12 / tymfgg-pearlLinks
Type Your Matrices For Great Good
☆29Updated 5 years ago
Alternatives and similar repositories for tymfgg-pearl
Users that are interested in tymfgg-pearl are comparing it to the libraries listed below
Sorting:
- Paper and talk☆55Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- being the scrapings of my stackoverflow answers☆48Updated 6 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- ☆16Updated 3 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- ☆32Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated 6 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- ☆50Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Where my everyday research happens☆55Updated 3 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago