dhil / pthandlersLinks
an encoding of affine effect handlers using pthreads
☆14Updated 3 years ago
Alternatives and similar repositories for pthandlers
Users that are interested in pthandlers are comparing it to the libraries listed below
Sorting:
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- flexible 'let rec' generation for MetaOCaml☆27Updated 3 months ago
- A simple λProlog interpreter☆20Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Higher kinded polymorphism in SML☆15Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 3 weeks ago
- Session types in Idris2!☆27Updated 4 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 8 months ago
- Linearizability Hoare Logic☆14Updated 8 months ago
- ☆17Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago