Experiences with functional programming revealed that higher-order concept leads to powerful and succinct programming. Functional logic programming, an approach to integrate functional and logic programming, would naturally be expected to incorporate the notion of higher-order-ness. Little has been investi-gated how to incorporate higher-order-ness in functional logic programming. In this paper we present a computation model for a higher-order functional and logic programming. Although investigations of computation models for higher-order functional logic languages are under way[13, 9, 8, 20, 22], implemented functional logic languages like K-LEAF[6] and Babel[18] among others, are all based on first-order models of computation. First-order narrowing has been used as basic computation mechanism.
展开▼
