m-yac / agda-knotsLinks
An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory
☆15Updated 7 years ago
Alternatives and similar repositories for agda-knots
Users that are interested in agda-knots are comparing it to the libraries listed below
Sorting:
- my phd thesis☆26Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- mirror of A simple type-theoretic language: Mini-TT☆41Updated 8 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- ☆26Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 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 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- Where my everyday research happens☆55Updated 2 weeks ago