Add to ORKGAbs t r ac t. A new formalism, called Hiord, for defining type-free higher-order logic programming languages with predicate abstraction is intro-duced. A model theory, based on partial combinatory algebras, is pre-sented, with respect to which the formalism is shown sound. A program-ming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is con-sidered, along with several examples.
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
This paper contains a systematic study of the foundations of knowledge representation, computation, ...
This paper presents a case for the use of higher-order logic as a foundation for computational logic...
Abstract. A new formalism, called Hiord, for defining type-free higherorder logic programming langua...
A new formalism, called Hiord, for defining type-free higherorder logic programming languages with p...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic p...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
International audienceFormal systems that describe computations over syntactic structures occur freq...
We demonstrate how the framework of higher-order logic programming ...
We demonstrate how the framework of higher-order logic programming ...
International audienceFormal systems that describe computations over syntactic structures occur freq...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
This paper contains a systematic study of the foundations of knowledge representation, computation, ...
This paper presents a case for the use of higher-order logic as a foundation for computational logic...
Abstract. A new formalism, called Hiord, for defining type-free higherorder logic programming langua...
A new formalism, called Hiord, for defining type-free higherorder logic programming languages with p...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
All in-text references underlined in blue are linked to publications on ResearchGate, letting you ac...
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic p...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
International audienceFormal systems that describe computations over syntactic structures occur freq...
We demonstrate how the framework of higher-order logic programming ...
We demonstrate how the framework of higher-order logic programming ...
International audienceFormal systems that describe computations over syntactic structures occur freq...
AbstractWe describe a novel logic, called HiLog, and show that it provides a more suitable basis for...
This paper analyses the requirements to the notion of type correctness in logic programming and prop...
This paper contains a systematic study of the foundations of knowledge representation, computation, ...
This paper presents a case for the use of higher-order logic as a foundation for computational logic...