Extensionality of Simply Typed Logic Programs. Probability, Networks and211 Algorithms

摘要

We set up a framework for the study of extensionality in the context of higher-211u001eorder logic programming. For simply typed logic programs we propose a novel 211u001edeclarative semantics, consisting of a model class with a semi-computable initial 211u001emodel, and a notion of extensionality in general, we develop a decidable, 211u001esyntactic criterion which is sufficient for extensionality. Some typical examples 211u001eof higher-order logic programs are shown to be extensional.