MatthewDaggitt / agda-routingLinks
An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
☆28Updated last year
Alternatives and similar repositories for agda-routing
Users that are interested in agda-routing are comparing it to the libraries listed below
Sorting:
- ☆17Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆16Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆18Updated 3 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- NbE course @ Chalmers☆28Updated 11 months ago