Abstract
The problems of compilation of a functional-logic language Flang are considered. A new phase of compilation — global dataflow analysis — is discussed. It is shown that this phase can extremely improve the performance of a produced code. For some benchmarks a code which is produced by the Flang compiler has about the same speed as the speed of corresponding Pascal programs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.Mantsivoda. Flang: A Functional-Logic Language. Proc. of Int. conf on Processing Declarative Knowledge.-Kaiserslautern, July 1991.
D.H.D.Warren. An Abstract Prolog Instruction Set. Technical Note 309 SRI International, Menlo Park, CA, October 1983.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge, 1989.
H.Boley. A relational/functional Language and its Compilation into the WAM. SEKI Report SR-90-05, University of Kaiserslautern, 1990.
P.L.van Roy Can Logic Programming Execute as Fast as Imperative Programming? PhD Dissertation, University of California at Berkeley, November 1990.
A. Taylor High Performance Prolog Implementation. PhD. Dissertation, Basser Department of Computer Science, University of Sydney, June 1991.
D. Turner. An Overview of Miranda. SIGPLAN Notices, vol 21, No 12.
G. Janssens, B. Demoen, A. Marten. Improving the Register Allocation in WAM by Reordering Unification. Proc. 5th Int. Conf. Symp. Logic Programming, pp. 1388–1402, MIT Press, Cambridge, MA, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mantsivoda, A., Petukhin, V. (1992). Compiling flang. In: Kastens, U., Pfahler, P. (eds) Compiler Construction. CC 1992. Lecture Notes in Computer Science, vol 641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55984-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-55984-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55984-9
Online ISBN: 978-3-540-47335-0
eBook Packages: Springer Book Archive