Results 1 
3 of
3
FunctionalLogic Integration Via Minimal Reciprocal Extensions
"... RELFUN reciprocally extends Horn RELations and callbyvalue FUNctions just enough to yield a unified operator concept. Relations acquire application nesting and higherorder notation; functions acquire nongroundness and nondeterminism. Relations are defined by Hornlike clauses implicitly returni ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
RELFUN reciprocally extends Horn RELations and callbyvalue FUNctions just enough to yield a unified operator concept. Relations acquire application nesting and higherorder notation; functions acquire nongroundness and nondeterminism. Relations are defined by Hornlike clauses implicitly returning true; functions are defined by rules with an additional returnedvalue premise. This minimal relationalfunctional kernel permits common extensions without duplicate features in logic and functional languages. Procedural and modeltheoretic semantics are developed for kernel RELFUN, transferring the Herbrand models of (Hornclause) relational programming to (firstorder) functional programming. The compiler system reuses the register X1 of the Warren Abstract Machine for value returning, statically flattening general nestings while optimizing firstargument nestings. Applications include a (hyper)graph library, a CADtoNC transformer, and sharable knowledge bases. Key words: Functional pr...
A RelationalFunctional Integration for Declarative Programming
 Foundations of Computer Science: Potential { Theory { Cognition, number 1337 in LNCS
, 1997
"... ..."
(Show Context)
MultipleValued Horn Clauses and Their WAM Compilation
, 1998
"... Introduction The applicative (functional) and logic (relational) programming communities are still investing much eort in the development of independently standardized systems. While acceptable standards for languages like LISP and PROLOG will be of great practical utility, the separate growth of t ..."
Abstract
 Add to MetaCart
(Show Context)
Introduction The applicative (functional) and logic (relational) programming communities are still investing much eort in the development of independently standardized systems. While acceptable standards for languages like LISP and PROLOG will be of great practical utility, the separate growth of these software worlds also implies increasing duplication of eort. A possible alternative is to integrate the purely functional and relational language kernels, and then to develop a common impure language environment. Various functional/relational amalgamation approaches have been proposed (see, e.g., the monograph [DL86] and the survey [Han94]). They can be studied with emphasis on expressive power, semantic foundation, implementation method, or time/space eciency. Here we introduce a WAM implementation method [War83, GLLO85, AK91, VR94] of RELFUN (relational/functional language, [Bol92b]) extended by multiplevalued functions. First, however, the expressive power of RELFUN with multipl