Experiments with Realizability in Univalent Type Theory
-
Updated
Oct 21, 2024 - HTML
Experiments with Realizability in Univalent Type Theory
Proof assistant for realizability logic TCF
A backtracking-based algorithm to check if a given degree-size sequence can realize a simplicial complex
Présentation de l'article Focalisation and Classical Realizability de Guillaume Munch-Maccagnoni.
Multi-objective evolutionary repair of unrealisable specifications
Analyze digital designs on Windows with hierarchical RTL, waveform viewing, schematic exploration, and MCP workflows in one workbench.
To associate your repository with the realizability topic, visit your repo's landing page and select "manage topics."