FFaissole / Valuations
Synthetic Topology in Homotopy Type Theory for probabilstic programming
☆12Updated 7 years ago
Alternatives and similar repositories for Valuations:
Users that are interested in Valuations are comparing it to the libraries listed below
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A blog about Coq☆46Updated 3 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 3 weeks ago
- Algebraic Combinatorics in Coq☆38Updated 2 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- ☆46Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Cohesive type theory☆19Updated 3 years ago
- ☆22Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Monadic effects and equational reasonig in Coq☆70Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- ☆84Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆44Updated 8 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Work in progress☆34Updated 4 months ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago