matijapretnar / aeffLinks
An interactive interpreter for asynchronous algebraic effects
☆14Updated last year
Alternatives and similar repositories for aeff
Users that are interested in aeff are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 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 bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- A Teeny Type Theory☆26Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A simple functional programming language.☆21Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A formalization of System Fω in Agda☆17Updated 5 months ago
- ☆26Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago