danelahman / haskell-coop
An experimental Haskell library for programming with effectful runners.
☆29Updated 5 years ago
Alternatives and similar repositories for haskell-coop:
Users that are interested in haskell-coop are comparing it to the libraries listed below
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Where my everyday research happens☆52Updated 3 weeks ago
- Paper and talk☆53Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 weeks ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- ☆18Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆30Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- ICFP tutorial☆39Updated 3 years ago