All Projects → jaycech3n → Isabelle-HoTT

jaycech3n / Isabelle-HoTT

Licence: other
An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle

Programming Languages

Standard ML
205 projects
Isabelle
26 projects

Projects that are alternatives of or similar to Isabelle-HoTT

cicada
Cicada Language
Stars: ✭ 9 (-70%)
Mutual labels:  type-theory, interactive-theorem-proving
TypeTopology
Logical manifestations of topological concepts, and other things. This version adopts the univalent point of view.
Stars: ✭ 132 (+340%)
Mutual labels:  type-theory, homotopy-type-theory
Idris-HoTT
Homotopy Type Theory proofs in Idris
Stars: ✭ 19 (-36.67%)
Mutual labels:  type-theory, homotopy-type-theory
SymmetryBookFormalization
Univalent mathematics in Agda
Stars: ✭ 117 (+290%)
Mutual labels:  type-theory, homotopy-type-theory
cat
A categorical semantics library in Agda.
Stars: ✭ 16 (-46.67%)
Mutual labels:  type-theory
reed-thesis
My undergradate thesis on coinductive types in univalent type theory
Stars: ✭ 14 (-53.33%)
Mutual labels:  type-theory
Redtt
"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
Stars: ✭ 175 (+483.33%)
Mutual labels:  type-theory
Hott Uf Agda Lecture Notes
Lecture notes on univalent foundations of mathematics with Agda
Stars: ✭ 162 (+440%)
Mutual labels:  type-theory
formal-topology-in-UF
Formal Topology in Univalent Foundations (WIP).
Stars: ✭ 27 (-10%)
Mutual labels:  homotopy-type-theory
tt-in-cubical
Type Theory in Type Theory using Cubical Agda
Stars: ✭ 12 (-60%)
Mutual labels:  type-theory
shapesafe
SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory
Stars: ✭ 17 (-43.33%)
Mutual labels:  type-theory
reading-material
Reading schedule and our library of pdfs
Stars: ✭ 19 (-36.67%)
Mutual labels:  type-theory
voile-rs
Dependently-typed row-polymorphic programming language, evolved from minitt-rs
Stars: ✭ 89 (+196.67%)
Mutual labels:  type-theory
minitt-rs
Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust
Stars: ✭ 101 (+236.67%)
Mutual labels:  type-theory
Sml Redprl
The People's Refinement Logic
Stars: ✭ 214 (+613.33%)
Mutual labels:  type-theory
Lean
Homepage Theorem Proving in Lean FAQ
Stars: ✭ 2,006 (+6586.67%)
Mutual labels:  type-theory
abella
An interactive theorem prover based on lambda-tree syntax
Stars: ✭ 81 (+170%)
Mutual labels:  interactive-theorem-proving
variant
Variant types in TypeScript
Stars: ✭ 147 (+390%)
Mutual labels:  type-theory
path semantics
A research project in path semantics, a re-interpretation of functions for expressing mathematics
Stars: ✭ 136 (+353.33%)
Mutual labels:  type-theory
cat
A formalization of category theory in cubical Agda
Stars: ✭ 50 (+66.67%)
Mutual labels:  homotopy-type-theory

Isabelle/HoTT build

Isabelle/HoTT is an experimental implementation of homotopy type theory in the Isabelle interactive theorem prover. It largely follows the development of the theory in the Homotopy Type Theory book, but aims to be general enough to eventually support cubical and other kinds of homotopy type theories.

Work is slowly ongoing to develop the logic into a fully-featured proof environment in which one can formulate and prove mathematical statements, in the style of the univalent foundations school. While Isabelle has provided support for object logics based on Martin-Löf type theory since the beginning, these have largely been ignored in favor of Isabelle/HOL. Thus this project is also an experiment in creating a viable framework, based on dependent type theory, inside the simple type theoretic foundations of Isabelle/Pure.

Caveat prover: This project is under active experimentation and is not yet guaranteed fit for any particular purpose.

Usage

Isabelle/HoTT is compatible with Isabelle2021. To use, add the Isabelle/HoTT folder path to .isabelle/Isabelle2021/ROOTS (on Mac/Linux/cygwin installations):

$ echo path/to/Isabelle/HoTT >> ~/.isabelle/Isabelle2021/ROOTS

To-do list

In no particular order.

  • Dedicated type context data
  • Definitional unfolding, better simplification in the typechecker
  • Proper handling of universes
  • Recursive function definitions
  • Inductive type definitions
  • Higher inductive type definitions
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].