slindley / effect-handlers
☆80Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for effect-handlers
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- The Evolution of a Typechecker☆54Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Where my everyday research happens☆53Updated last week
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 weeks ago
- Logical relations proof in Agda☆24Updated 9 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- A TACtic library for Agda☆48Updated 2 months ago