This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| \import Function | |
| \import Paths | |
| \import Arith.Int | |
| \open Nat (-) | |
| \open IntRing (negative) | |
| -- # Raising a loop to an natural power | |
| -- | Concatenate a certain loop to itself ``n`` times. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| module RussellsParadox | |
| data Set : Type where | |
| MkSet : (a -> Set) -> Set | |
| elem : Set -> Set -> Type | |
| elem e (MkSet supp) = Exists (\ x => e = supp x) | |
| notElem : Set -> Set -> Type | |
| notElem e s = elem e s -> Void |