Control.Effects
☆19Apr 14, 2019Updated 6 years ago
Alternatives and similar repositories for effects
Users that are interested in effects are comparing it to the libraries listed below
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Dec 10, 2017Updated 8 years ago
- ☆18Apr 28, 2016Updated 9 years ago
- Haskell library of algebraic topology☆26Sep 23, 2011Updated 14 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- ☆31Oct 31, 2021Updated 4 years ago
- Implementation of Haskell CRDTs (Commutative Replicated Data Types)☆13Mar 5, 2012Updated 14 years ago
- ☆13Mar 2, 2015Updated 11 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆30Jun 7, 2014Updated 11 years ago
- Semigroups, specialized containers and a general map/reduce framework☆46Mar 3, 2025Updated last year
- Combinators for bidirectional JSON parsing☆21May 29, 2014Updated 11 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- C Layer for Dhall Language☆15Feb 6, 2021Updated 5 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- A webpack loader for Haskell (!)☆15Feb 23, 2015Updated 11 years ago
- Class of data structures that can be unfolded.☆22Jan 6, 2026Updated last month
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 5 months ago
- ☆15Oct 24, 2017Updated 8 years ago
- Polymorphic guarded λ-calculus☆22Jul 17, 2025Updated 7 months ago
- Safe, programmable, speculative evaluation for Haskell☆29Oct 22, 2018Updated 7 years ago
- Session types for asynchronous networking☆21Nov 19, 2015Updated 10 years ago
- Arrow based stream transducer☆20Jun 21, 2020Updated 5 years ago
- Unpinned byte arrays in GHC haskell☆22Jan 8, 2019Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Algebraic Effects in Haskell using Implicit Parameters☆47Aug 16, 2020Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- Optics via the profunctor representation theorem☆24Dec 6, 2024Updated last year
- ☆21Sep 8, 2021Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Tactic Metaprogramming in Haskell☆56Jul 7, 2019Updated 6 years ago
- MPFR bindings for Haskell☆34Oct 2, 2023Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- A small Coq library for collecting side conditions and deferring their proof☆26Oct 14, 2019Updated 6 years ago
- ☆23Aug 30, 2017Updated 8 years ago