rocq-archive / graph-basicsLinks
a Coq toolkit for graph theory
☆13Updated 4 years ago
Alternatives and similar repositories for graph-basics
Users that are interested in graph-basics are comparing it to the libraries listed below
Sorting:
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- LaTeX code for a paper on lean's type theory☆144Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- HoTT in Lean 3☆80Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 5 months ago
- ☆88Updated 4 months ago
- Programming library for Agda☆130Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- apkg - package manager for Agda☆38Updated 4 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated 10 months ago
- ☆84Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 10 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Lecture notes on realizability☆74Updated 6 months ago
- Tutorial series introducing Agda to the people at BCAM☆27Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- ☆36Updated 3 years ago