andrejbauer / mathematical-storiesLinks
Mathematical stories
☆13Updated 4 years ago
Alternatives and similar repositories for mathematical-stories
Users that are interested in mathematical-stories are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆18Updated 3 years ago
- ☆21Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- ☆29Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- ☆47Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 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
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A (formalised) general definition of type theories☆58Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Synthetic Differential Geometry in Agda☆13Updated 10 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- Directed type theory for formal category theory☆17Updated 8 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- NbE course @ Chalmers☆28Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 6 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- Agda-style equational reasoning in Haskell☆54Updated 7 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago