m-yac / agda-knotsView external linksLinks
An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory
☆15Oct 15, 2018Updated 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:
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Yet another Scheme interpreter.☆11Sep 17, 2022Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- ☆10May 3, 2017Updated 8 years ago
- Constructive Interpretations of HoTT☆36Aug 26, 2020Updated 5 years ago
- Repository for the course Logical Verification 2019–2020 at VU Amsterdam☆13Dec 16, 2019Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- ☆18May 10, 2022Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Conference on Homotopy Type Theory 2019☆16Sep 18, 2019Updated 6 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- 用作文档目的，翻译方式见 Issue #10☆41Apr 1, 2019Updated 6 years ago
- A microKanren framework for implementing constraints.☆19May 30, 2018Updated 7 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- PL syntax macros.☆21Nov 30, 2025Updated 2 months ago
- Toy programming language☆20May 18, 2024Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated last month
- Proof automation – for Agda, in Agda.☆45Sep 7, 2020Updated 5 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Feb 22, 2020Updated 5 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Lecture note on Lambda Calculus and Types for FLOLAC☆27Jul 2, 2024Updated last year
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 2 months ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- Libraries and tools for topological and geometric modeling.☆17Mar 23, 2025Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago