A Direct Semantic Characterization of RELFUN (1998)
| Venue: | Proceedings of the 3rd International Workshop on Extensions of Logic Programming, ELP '92, Bologna 1992, volume 660 of LNAI |
| Citations: | 3 - 3 self |
BibTeX
@INPROCEEDINGS{Boley98adirect,
author = {Harold Boley and Deutsches Forschungszentrum and Kunstliche Intelligenz},
title = {A Direct Semantic Characterization of RELFUN},
booktitle = {Proceedings of the 3rd International Workshop on Extensions of Logic Programming, ELP '92, Bologna 1992, volume 660 of LNAI},
year = {1998},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Introduction RELFUN is a logic language primarily extended by call-by-value (eager) functions that may be non-ground, non-deterministic, varying-arity, and higher-order. These functions are defined by extended Horn clauses having a `foot' premise for value returning. This extension can also be viewed as (directed) conditional equations permitting `extra' variables in conditions, which may accumulate partial results. It entails the following syntactic changes of PROLOG: Footed clauses: Starting with DATALOG, ":-"-rules may be augmented by an ampersand infix, "&", between the normal body premises and the foot premise; facts (empty bodies), by a joined infix, ":&". Active expressions: Proceeding to PROLOG, passive structures are rewritten using square brackets, "[...]", reserving round parentheses, "(...)", for RELFUN's active call-byvalue expressions (per
