Experiments with Realizability in Univalent Type Theory
-
Updated
May 20, 2024 - Agda
Experiments with Realizability in Univalent Type Theory
A backtracking-based algorithm to check if a given degree-size sequence can realize a simplicial complex
Proof assistant for realizability logic TCF
Présentation de l'article Focalisation and Classical Realizability de Guillaume Munch-Maccagnoni.
Add a description, image, and links to the realizability topic page so that developers can more easily learn about it.
To associate your repository with the realizability topic, visit your repo's landing page and select "manage topics."