Re:Python 3 Q&A by a prolific core developer
by DannoHung on Friday June 29, 2012 @05:08AM
(#4175847)
Uhh, how would you make a linked list with a circle in it with the Haskell List type?
a = 1:aThis trick is often called "Tying the Knot", if anyone is interested.
makeCircle rst = rst ++ makeCircle rst
The thing is that a circular list is actually an infinite list in Haskell. ;)
Re:Python 3 Q&A by a prolific core developer
by DannoHung on Friday June 29, 2012 @11:27AM
(#4177077)
If you want to prevent that then you want to take general recursion out of your programming language and if you're gonna do that you might as well make it Turing incomplete.
These aren't "circles" per se, they are partially evaluated recursive structures. If you expand them you end up with evaluated list structures that are non-self referential.
This is not a real circular list though, since it does not tie the knot as in dbaupp's comment.
However, not "in general". The general problem is that bogus data leads to an irreparable situation. To fix that bug, you have to find out who broke the data. Consider for example, a circle in a linked list. You would need quite an expressive type system to prevent that statically (dependent types might suffice? Theorem provers are the ultimate hammer).