A Neighborhood of Infinity: Reverse Engineering Machines with the Yoneda Lemma

blog.sigfpe.com · 3,369 words · saved by 1 readers

I've decided that the Yoneda lemma is the hardest trivial thing in mathematics, though I find it's made easier if I think about it in terms ...

A Neighborhood of Infinity: Reverse Engineering Machines with the Yoneda Lemma Search This Blog Sunday, November 12, 2006 Reverse Engineering Machines with the Yoneda Lemma I've decided that the Yoneda lemma is the hardest trivial thing in mathematics, though I find it's made easier if I think about it in terms of reverse engineering machines. So, suppose you have some mysterious machine. You know it's a pure functional Haskell machine (of course) with no funny stuff (no overlapping or incoherent instances or anything like that [1] ). The machine works like this: for some fixed type A , whenev

A Neighborhood of Infinity: Reverse Engineering Machines with the Yoneda Lemma

related reading