jaycech3n / Isabelle-HoTTLinks
An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
☆34Updated 3 years ago
Alternatives and similar repositories for Isabelle-HoTT
Users that are interested in Isabelle-HoTT are comparing it to the libraries listed below
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A TACtic library for Agda☆51Updated last year
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- ☆32Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Category theory and algebra☆26Updated 9 years ago
- Miller/pattern unification in Agda☆67Updated 3 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Mtac in Agda☆29Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆51Updated 5 months ago