Here's a neat test of programming language expressiveness: Can you write a function PrintXY taking an integer n>=0 that prints all strings of length n containing only the characters 'X' and 'Y'? Can you do it without recursion, and without assuming n<=64? Is it readable?
-
-
This is what Prolog was designed for: Convenient and efficient processing of natural text. Recent Prolog systems such as Scryer Prolog and Tau Prolog are beginning to unleash the full power of Prolog for this use case by representing strings as lists of characters, efficiently.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.