Yaghi, Ali A. G. (1983) The compilation of functional language into intensional logic. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Preview

PDF WRAP_cs-rr-056.pdf - Other - Requires a PDF viewer. Download (1669Kb) | Preview

Request Changes to record.

Abstract

In this paper we propose a new- implementation technique for functional languages by compilation into intensional logic, [Car49] [Mon74]. Based on this logic, we define the concept of intensional algebras in which the value of a symbol in the signature is a family of objects which denotes its value to different worlds in the universe. Our target code is the family of languages DE, definitional equations; it is the family I DE(A) | A is an intensional algebra. A program in a member of this family is a set of non-ambiguous equations defining nullary variable symbols. One of these variables should be the symbol result.

To show both the validity and the efficiency, of our approach we apply it to the family of languages Iswum. The source family lswum= | Iswum(B) | B is an extensional algebra is the subset of Landin's Iswrm which does not allow higher order functions. Moreover, in lswurm we alow lswurs where-clause only in defining functions; and we assume that the equations are non-ambiguous. The extension of our approach to cope with higher order functions is straightforward and is discussed in [Yag8a].

Finally we give, briefly, two algorithms f or evaluating intensional expressions. The first is reductive and based on a set of rewrite rules, the second is dynamic and based on a demand driven data flow architecture.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Functional programming languages
Series Name:	Department of Computer Science Research Report
Publisher:	University of Warwick. Department of Computer Science
Place of Publication:	Coventry, UK
Official Date:	December 1983
Dates:	Date Event December 1983 Completion
Number:	Number 56
DOI:	CS-RR-056
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Funder:	Science and Engineering Research Council (Great Britain) (SERC)
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads