sto0pkid / CategoryTheoryLinks
Category Theory in Agda
☆13Updated 8 years ago
Alternatives and similar repositories for CategoryTheory
Users that are interested in CategoryTheory are comparing it to the libraries listed below
Sorting:
- Interactive and object-oriented programming in Agda using coinductive types☆25Updated last month
- An Agda formalisation of the theory of directed containers☆12Updated 8 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated last year
- ☆12Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Ring solver for Idris☆20Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Work in progress☆39Updated 7 months ago
- Functional Programing in Scala (in Idris) [Idris]☆16Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- ☆26Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago