Please use this identifier to cite or link to this item: doi:10.22028/D291-25237
Title: RFM manual : compiling RELFUN into the relational/functional machine
Author(s): Boley, Harold
Elsbernd, Klaus
Hein, Hans-Günther
Krause, Thomas
Perling, Markus
Sintek, Michael
Stein, Werner
Language: English
Year of Publication: 1996
SWD key words: Künstliche Intelligenz
Free key words: Artificial Intelligence
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: The compilation of RELFUN programs consists of two main stages, horizontal transformations and vertical translations. The horizontal transformer performs both source-to-source steps into a subset of RELFUN and source-to-intermediate steps into a RELFUN-like language. The vertical translator is also divided into two phases, the classifier and the code generator. The classifier produces a declarative clause language; the code generator optimizes target code for underlying WAM emulators. These parts can be used incrementally-individually, as a relational/functional compilation laboratory, or batch-composed, as a complete RELFUN compiler. All intermediate steps employ explicit declarative representations, which can be displayed via RELFUN´s user interface. The compiler is implemented in a subset of COMMON LISP; one emulator runs in COMMON LISP, the other in ANSI C.
Link to this record: urn:nbn:de:bsz:291-scidok-50715
Series name: Document / Deutsches Forschungszentrum für Künstliche Intelligenz : D [ISSN 0946-0098]
Series volume: 91-03
Date of registration: 7-Mar-2013
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
D_91_03.pdf24,26 MBAdobe PDFView/Open

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