zbMATH — the first resource for mathematics

Equivalence of the quotient term model and the least complete Herbrand model for a functional logic model. (English) Zbl 0924.68048
Summary: This paper addresses the semantics of a first-order functional logic language, from the viewpoint of conditional equational logic. A functional logic program is regarded as a set of nonlogical axioms of conditional equational logic that are interpreted as defining a function. A query is considered to be an existentially quantified equation, and solving the query proves the existentially quantified equation by obtaining a witness. This is justified by showing equivalence of three models for the functional logic program, i.e., the quotient term model, the least complete Herbrand model, and the operational model of narrowing.

68N17 Logic programming
68Q55 Semantics in the theory of computing
Full Text: Link