Prolog is turing-complete and hence can be used to construct programs
which do not terminate.
On 10/16/2017 09:42 AM, Konstantin Tokarev wrote:
16.10.2017, 16:17, "Adam Treat" <adam.tr...@qt.io>:
You'll need a strongly normalizing language for that which does not
allow general recursion. Something built on the simply typed lambda
calculus, but with added syntactic sugar would do.
Maybe Prolog would do it too.
Ulf
_______________________________________________
Development mailing list
Development@qt-project.org
http://lists.qt-project.org/mailman/listinfo/development
_______________________________________________
Development mailing list
Development@qt-project.org
http://lists.qt-project.org/mailman/listinfo/development
_______________________________________________
Development mailing list
Development@qt-project.org
http://lists.qt-project.org/mailman/listinfo/development
