Y
Hacker News
new
|
ask
|
show
|
jobs
by
ihm
1259 days ago
That theorem is not valid constructively, so no way to make a computer program out of it. I.e., there is no program that given types A, B and injections (f : A -> B) and (g : B -> A) produces a bijection A -> B.
1 comments
rustybolt
1258 days ago
I'm pretty sure it is.
link