#### Filter Results:

#### Publication Year

1991

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We propose a new approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion. Programs in our paradigm are theories in a constructor based conditional rewriting logic. We present proof calculi and a model theory for this logic, and we prove the… (More)

According to a well known conception, programs in a declarative programming language can be viewed as theories in some suitable logic, while computations can be viewed as deductions. In our opinion, there is yet no general assent on the logic to be viewed as the foundation of higher order, lazy functional logic languages. In this paper, we argue that a… (More)

In 17], Warren suggested a method for embedding higher-order (HO) programming constructs into Prolog, that can be viewed as a kind of higher-order into rst-order (FO) translation. This method has been used in diierent settings as a tool for the combination of functional and logic programming 3, 2, 1], or even for the reduction of the former to the later 4].… (More)

One of the key issues in development of Multi-agent System(MAS) is to follow the more suitable development process for a particular problem. This means that development process models must be defined. Definition leads to better process understanding, facilitates process measurement and improvement, and constitutes the basis for automating the process… (More)

We propose an approach to declarative programming which integrates the functional and relational paradigms by taking possibly non-deterministic lazy functions as the fundamental notion. Classical equational logic does not supply a suitable semantics in a natural way. Therefore, we suggest to view programs as theories in a constructor-based conditional… (More)

Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted… (More)