kandersen / dpcLinks
Distributed Protocol Combinators
☆14Updated 4 years ago
Alternatives and similar repositories for dpc
Users that are interested in dpc are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- ☆16Updated 11 months ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- ☆29Updated 10 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆28Updated 6 years ago
- ☆35Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Updated 2 years ago
- Classical Logic in Haskell☆24Updated 2 months ago
- Haskell port of the WebAssembly OCaml reference interpreter☆45Updated 2 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago