kandersen / dpc
Distributed Protocol Combinators
☆13Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for dpc
- A simple implementation of linear type theory☆38Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆29Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- ☆16Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 4 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- ☆20Updated 6 years ago
- being an experiment with potato power☆23Updated 4 years ago
- Haskell's Core in K.☆20Updated 7 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A monadic interface for DAG construction.☆24Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago