MatthewDaggitt / agda-routing
An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
☆24Updated 8 months ago
Related projects: ⓘ
- ☆18Updated 2 years ago
- ☆17Updated 5 years ago
- Monoidal Toposes of Grammars and Semantic Actions☆16Updated this week
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Linear map categories in Agda☆5Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 5 months ago
- Quasi-quoting library for agda☆16Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- ☆28Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- ☆16Updated 2 years ago
- A certified semantics for relational programming workout.☆25Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆15Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆18Updated last week
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago