--
You received this message because you are subscribed to the Google Groups "ceylon-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to ceylon-users...@googlegroups.com.
To post to this group, send email to ceylon...@googlegroups.com.
Visit this group at http://groups.google.com/group/ceylon-users.
To view this discussion on the web visit https://groups.google.com/d/msgid/ceylon-users/c3ed0168-45a1-4232-b6e1-ead62815c3ae%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
As far as I can tell (I haven’t looked into it too much), these all feature constant-size programs, demonstrating that compilation of these languages is undecidable. This is significantly more powerful than what I’m doing here (too powerful in my opinion, but that’s a question of personal taste).
This seems a lot more similar to what I’m doing: Is the C99 preprocessor Turing complete? Apparently, it is if you supply an external loop to feed the preprocessor back into itself, or if you define that loop in the program via additional statements.
Any other examples?
To view this discussion on the web visit https://groups.google.com/d/msgid/ceylon-users/61737937-4a1b-4777-a80f-1689963c62aa%40googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/ceylon-users/CABnofR5M7qQ_wu%3DePq_3kas-3v4%3Dy4DiFV%3DL7HUBF-77Pd71vQ%40mail.gmail.com.