by Werner Stein, Michael Sintek
Relfun/X - An Experimental Prolog Implementation of Relfun
Relfun/X is an experimental implementation of Relfun, a relational and functional laguage 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.
This document is available as PDF-File.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.