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
- ☆29Updated 10 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 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
- 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
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- ☆16Updated 10 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- ☆16Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆51Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago