MatthewDaggitt / agda-routing
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
- A formalization of finite, constructive log analysis using linear temporal logic☆21Updated last week
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Linear map categories in Agda☆5Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆18Updated 2 years ago
- ☆16Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆19Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- ☆29Updated 2 years ago
- Mtac in Agda☆28Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- Category theory and algebra☆28Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago