by Thomas Krause
Globale Datenflußanalyse und horizontale Compilation der relational-funktionalen Sprache RELFUN
The compilation of the relational-functional language RELFUN is enhanced by source-level (horizontal) preprocessing. A horizontal compiler transforms the language into a normal-form kernel. This includes right-hand-side propagation, static unification, sharing, pre-evaluation, and reordering. The transformations are specified as a collection of term-rewriting systems plus a control algorithm. Building on the PROLOG mode interpreter of Saumya K. Debray, a global mode or data-flow analyzer for RELFUN call patterns is developed. All compiler enhancements described are running in LISP.
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.