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:
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years 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
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A Teeny Type Theory☆27Updated 3 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- ☆26Updated 9 years ago
- A simple functional programming language.☆22Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago