Hacker News Reader

Things get more interestinger once you realize that it's all just degenerative cases of bidirectional cyclic graphs.

The tough part is finding a tidy syntax for representing said bidirectional cyclic graphs.

A programming language with support for arbitrary graph literals would make me happy.

If I understand correctly, that's just like Common Lisp's way to specify cyclic references. http://www.lispworks.com/documentation/HyperSpec/Body/02_dhp...