Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-07T22:25:42.018Z Has data issue: false hasContentIssue false
  • English
  • Français

Higher-order functional languages and intensional logic

Published online by Cambridge University Press:  01 September 1999

P. RONDOGIANNIS  and
W. W. WADGE
P. RONDOGIANNIS
Affiliation:
Department of Computer Science, University of Ioannina, P.O. Box 1186, GR 45110 Ioannina, Greece (e-mail: [email protected])
W. W. WADGE
Affiliation:
Department of Computer Science, University of Victoria, P.O. Box 3055, Victoria, BC, Canada V8W 3P6 (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context manipulation (i.e. intensional) operators. The transformation takes place in M steps, where M is the order of the initial functional program. During each step the order of the program is reduced by one, and the final outcome of the algorithm is an M-dimensional intensional program of order zero. As the resulting intensional code can be executed in a purely tagged-dataflow way, the proposed approach offers a promising new technique for the implementation of higher-order functional languages.

Type
Research Article
Information
Journal of Functional Programming , Volume 9 , Issue 5 , September 1999 , pp. 527 - 564
Copyright
© 1999 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.