Please use this identifier to cite or link to this item: doi:10.22028/D291-39816
Title: RELFUN : A Relational/Functional Integration with Valued Clauses
Author(s): Boley, Harold
Language: English
Year of Publication: 1986
Place of publication: Kaiserslautern
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: The RELFUN programming language is introduced as an attempt to integrate the capabilities of the relational and functional styles. Definitions of functions and relations are specified uniformly by valued Horn clauses, where rules return the value of their right-most premise. Functional nestings are flattened to relational conjunctions, using a purified version of PROLOG's is-primitive. RELFUN functions may have non-ground arguments, like relations, and/or return non-ground values; their input and output arguments can be inverted like those of relations. Higher-order functions are definable as (function-)valued clauses, with funarg problems being avoided by the standard renaming of clause variables. RELFUN´s operational semantics is specified as an abstract machine, which also yields its first (e-mailable) FRANZ LISP implementation.
Link to this record: urn:nbn:de:bsz:291--ds-398162
Series name: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Series volume: 86,4
Date of registration: 22-Jun-2023
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professorship: SE - Sonstige
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
SEKI-REPORT-SR-86-04_Boley_RELFUN-A-Relational-Functional-Integration-with-Valued-Clauses.pdf4,61 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.