proglang / ldgvLinks
Label dependent dependent session types
☆16Updated last year
Alternatives and similar repositories for ldgv
Users that are interested in ldgv are comparing it to the libraries listed below
Sorting:
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Experiments with linear types☆14Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- ☆16Updated 8 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Edit is a monad for rewriting things.☆23Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆21Updated 7 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- an experiment in presenting code.☆14Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Zippers for cofree types☆13Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago