jdoughertyii / hott-speciesLinks
Combinatorial species in HoTT
☆12Updated 10 years ago
Alternatives and similar repositories for hott-species
Users that are interested in hott-species are comparing it to the libraries listed below
Sorting:
- Directed type theory for formal category theory☆17Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- ☆17Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Reflection library for Coq☆12Updated 5 years ago
- Cohesive type theory☆19Updated 3 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- A string diagram generator for LaTeX.☆30Updated 2 years ago
- topos programming☆31Updated 6 years ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- ☆18Updated 3 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Typed DSLs for sorting☆19Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago