OPLSS / introduction-to-algebraic-effects-and-handlersView external linksLinks
Introduction to algebraic effects and handlers
☆100Jul 21, 2018Updated 7 years ago
Alternatives and similar repositories for introduction-to-algebraic-effects-and-handlers
Users that are interested in introduction-to-algebraic-effects-and-handlers are comparing it to the libraries listed below
Sorting:
- ☆48Jul 5, 2019Updated 6 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆13Jan 26, 2023Updated 3 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Mar 29, 2019Updated 6 years ago
- Real number computation software☆129Aug 16, 2022Updated 3 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago
- A collaborative bibliography of work related to the theory and practice of computational effects☆1,113Nov 4, 2025Updated 3 months ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Course Webpage for B522 Programming Language Foundations, Spring 2020, Indiana University☆55May 28, 2020Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Benchmark repository of polyglot effect handler examples☆34Aug 21, 2025Updated 5 months ago
- Lecture notes for a short course on proving/programming in Coq via SSReflect.☆175Jun 24, 2021Updated 4 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- ☆84May 10, 2024Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Contextual types meet mechanized metatheory!☆206Sep 30, 2025Updated 4 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year