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
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- ☆18Updated 3 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆17Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆29Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Mtac in Agda☆28Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months 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
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- STLC-related snippets in Agda☆16Updated 12 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆22Updated last week
- ☆21Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago