No, nix wasn't joking. If you use C++ templates and limit yourself to numbers then it really is turing complete. Haskell, with the right flags (undecidable instances and overlapping instances) is also Turing complete. Cayenne is deliberately so and many people are now really thinking that it's just better to permit Turing completeness and let the programmer take responsibility. The alternative is more like what Epigram is looking at (amongst others) where you limit recursion to on the structure of terms and prevent infinite structures. That way, you can still guarantee termination. I fear we may now be some way from the original issue though ;)
Copyright © 2017, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds