dhil / pthandlersLinks
an encoding of affine effect handlers using pthreads
☆14Updated 2 years ago
Alternatives and similar repositories for pthandlers
Users that are interested in pthandlers are comparing it to the libraries listed below
Sorting:
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- 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 library for hierarchical names and lexical scoping☆26Updated last month
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Higher kinded polymorphism in SML☆15Updated 5 years ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆32Updated 6 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.☆22Updated 8 years 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
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆16Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago