dorchard / effects-as-sessionsLinks
Formalised embedding of an imperative language with effect system into session-typed pi calculus.
☆29Updated last year
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
- Type Theory with Indexed Equality☆26Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- ☆21Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 8 months ago
- Miller/pattern unification in Agda☆66Updated last month
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago