Relfun/X is an experimental implementation of Relfun, a relational and functional language developed by Harold Boley at Kaiserslautern University. It is totally implemented in Prolog; additionally, the Relfun/X programs are compiled into Prolog programs (i.e. "consulted" analogously to the ordinary consulting scheme of Prolog). While Relfun/X does not provide all the features of the Lisp-based Relfun implementation, it is the first running version supporting Relfun´s multi-footed clauses
Over the past few years much interest has been shown in the computer language Prolog, a fifth genera...
PROLOG is a programming language based on the use of mathematical logic—specifically the first order...
Prolog was invented in the early seventies at the University of Marseille. Prolog stands for PROgram...
Ein Parser zum Erkennen und ein Pretty-Printer zum Erzeugen der Prolog-artigen Syntax von Relfun wer...
A practical description of relational/functional programming in RELFUN is given. The language constr...
Extensions of logic and functional programming are integrated in RELFUN. Its valued clauses comprise...
This paper attempts a direct semantic formalization of first-order relational-functional languages (...
The RELFUN programming language is introduced as an attempt to integrate the capabilities of the rel...
In FLIP, a novel approach to the integration of relational and functional languages on the basis of ...
Prolog has been widely recognized as a powerful programming language for artificial intelligence. It...
The compilation of RELFUN programs consists of two main stages, horizontal transformations and verti...
Adhering to the principles of logic programming results in greater expressiveness than is obtained b...
This thesis focuses on combining the two most important and wide spread declarative programming para...
Prolog, an acronym for Pro-gramming in Log-ic, is a product of artificial intelligence research with...
GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself fr...
Over the past few years much interest has been shown in the computer language Prolog, a fifth genera...
PROLOG is a programming language based on the use of mathematical logic—specifically the first order...
Prolog was invented in the early seventies at the University of Marseille. Prolog stands for PROgram...
Ein Parser zum Erkennen und ein Pretty-Printer zum Erzeugen der Prolog-artigen Syntax von Relfun wer...
A practical description of relational/functional programming in RELFUN is given. The language constr...
Extensions of logic and functional programming are integrated in RELFUN. Its valued clauses comprise...
This paper attempts a direct semantic formalization of first-order relational-functional languages (...
The RELFUN programming language is introduced as an attempt to integrate the capabilities of the rel...
In FLIP, a novel approach to the integration of relational and functional languages on the basis of ...
Prolog has been widely recognized as a powerful programming language for artificial intelligence. It...
The compilation of RELFUN programs consists of two main stages, horizontal transformations and verti...
Adhering to the principles of logic programming results in greater expressiveness than is obtained b...
This thesis focuses on combining the two most important and wide spread declarative programming para...
Prolog, an acronym for Pro-gramming in Log-ic, is a product of artificial intelligence research with...
GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself fr...
Over the past few years much interest has been shown in the computer language Prolog, a fifth genera...
PROLOG is a programming language based on the use of mathematical logic—specifically the first order...
Prolog was invented in the early seventies at the University of Marseille. Prolog stands for PROgram...