You have to be careful when using Haskell for this sort of thing, because you can, for example, have a term of type Void:
inhabitantOfZero :: Void
inhabitantOfZero = fix id
(Side note: the empty type can also be interpreted as the type of non-terminating computations, and in fact typing 'fix id' into ghci will cause it to hang)
It turns out that πβ° = π is true, though, and if I'm not mistaken, this is true of semirings in general (where the exponent has a natural interpretation; of course you can define exponentiation this way for any semiring you like). This sole inhabitant is the empty function, which is easiest to explain in set-theoretic terms: if you define a function from A to B to be a subset of A Γ B such that each a β A appears exactly once (for example, the negation function on Bool would be the set {(true, false), (false, true)}), it's clear that there's exactly one function from the empty set to the empty set, because there is only one subset of β
Γ β
(i.e., β
) and for this set the above property is vacuously true.
For completeness, here's what the empty function looks like in Agda, which treats types much more carefully than Haskell (to understand why, look up intuitionistic logic/type theory and the Curry-Howard isomorphism):
module EmptyFunction where
data β₯ : Set where
-- No constructors, since β₯ is empty
inhabitant-of-πβ° : β₯ β β₯
inhabitant-of-πβ° ()