sjoerdvisscher / effects
Control.Effects
☆19Updated 6 years ago
Alternatives and similar repositories for effects:
Users that are interested in effects are comparing it to the libraries listed below
- being a thing I build on a Saturday☆28Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Dependently Typed Extensible Records with Prototypal Inheritance☆9Updated 10 years ago
- ☆14Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 4 months ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- ☆23Updated 7 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 5 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated 7 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Kleene algebra, regular expressions☆32Updated last year
- An experimental intermediate language for GHC☆36Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 3 years ago