MatthewDaggitt / agda-routingLinks
An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
☆27Updated 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆18Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- ☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated last week
- Linear map categories in Agda☆5Updated 2 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 4 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 3 months ago
- Compiler backend for generating Scheme code☆26Updated last year
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago