Extensional Higher-Order Logic Programming — mentioned by rntz

Wed, 23 Mar 2016 12:04:27 GMT

I've just published a draft paper on an entirely different approach to the same problem: instead of creating a higher-order Prolog, we've discovered a functional (and so higher-order) analogue of Datalog, a more limited language (http://www.rntz.net/files/datafun.pdf, on github at https://www.github.com/rntz/datafun) This idea of a higher-order Prolog is very interesting! But it's not clear to me how it can be truly extensional without further limiting the language. For there is another reason why Prolog is not extensional: non-termination. As a simple example, consider this program: q(X)…

Paper and discussion history. A mention is not an endorsement.

Extensional Higher-Order Logic Programming · HackerPapers discussions

Extensional Higher-Order Logic Programming — mentioned by rntz