danelahman / haskell-coopLinks
An experimental Haskell library for programming with effectful runners.
☆30Updated 6 years ago
Alternatives and similar repositories for haskell-coop
Users that are interested in haskell-coop are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- ☆52Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Where my everyday research happens☆55Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 2 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆20Updated last year
- ICFP tutorial☆39Updated 4 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago