The maybe monad on finite types
Content created by Fredrik Bakke, Egbert Rijke and Jonathan Prieto-Cubides.
Created on 2022-02-16.
Last modified on 2024-09-23.
module univalent-combinatorics.maybe where open import foundation.maybe public
Imports
open import elementary-number-theory.natural-numbers open import foundation.universe-levels open import univalent-combinatorics.coproduct-types open import univalent-combinatorics.finite-types
add-free-point-UU-Fin : {l1 : Level} (k : ℕ) → UU-Fin l1 k → UU-Fin l1 (succ-ℕ k) add-free-point-UU-Fin k X = coproduct-UU-Fin k 1 X unit-UU-Fin
Recent changes
- 2024-09-23. Fredrik Bakke. Cantor’s theorem and diagonal argument (#1185).
- 2024-02-06. Fredrik Bakke. Rename
(co)prod
to(co)product
(#1017). - 2023-06-07. Fredrik Bakke. Move public imports before “Imports” block (#642).
- 2023-03-10. Fredrik Bakke. Additions to
fix-import
(#497). - 2023-03-09. Jonathan Prieto-Cubides. Add hooks (#495).