dorchard / effects-as-sessionsLinks
Formalised embedding of an imperative language with effect system into session-typed pi calculus.
☆29Updated 9 months ago
Alternatives and similar repositories for effects-as-sessions
Users that are interested in effects-as-sessions are comparing it to the libraries listed below
Sorting:
- being an experiment with potato power☆23Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- ☆16Updated 3 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago