QIIT Brouwer-tree ordinals in Cubical Agda, with a recursive computing order defined without {-# TERMINATING #-}
-
Updated
Jun 22, 2026 - Makefile
QIIT Brouwer-tree ordinals in Cubical Agda, with a recursive computing order defined without {-# TERMINATING #-}
Add a description, image, and links to the brouwer-trees topic page so that developers can more easily learn about it.
To associate your repository with the brouwer-trees topic, visit your repo's landing page and select "manage topics."