H. Barendregt and M. van Leeuwen. Functional programming and the language TALE. Technical Report 412, University of Utrecht Dept. of Mathematics, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....This, then, is the commonly accepted foundation for functional programming; more precisely, for the lazy functional languages, which represent the mainstream of current functional programming practice. Examples: MIRANDA [Tur85] LML [Aug84] LISPKIT [Hen80] ORWELL [Wad85] PONDER [Fai85] TALE [BvL86]. But do these languages as de ned and implemented actually evaluate terms to head normal form To the best of my knowledge, not a single one of them does so. Instead, they evaluate to weak head normal form, i.e. they do not evaluate under abstractions. x: y:y)M is in weak head normal form, ....

H. Barendregt and M. van Leeuwen. Functional programming and the language TALE. Technical Report 412, University of Utrecht Dept. of Mathematics, 1986.

....by a lazy computation before, referring to a yet uncomputed result. The transformation of the Prolog program into a functional program proceeds in four stages. Each transformation stage will now be discussed in detail in subsequent sections. We will use some primitives from the languages Tale [4] and Haskell [17] Their type signatures, along with those of a few standard functions are shown below. array ff j : matrix ff j : descr j ( num; num) num; num) get descr : matrix ff descr tabulate : num num ff) descr matrix ff subscript : array ff num ff iterate ....

H. P. Barendregt and M. van Leeuwen. Functional programming and the language Tale. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current trends in concurrency: overviews and tutorials, LNCS 224, pages 122--208, Noordwijkerhout, The Netherlands, Jun 1985. Springer-Verlag, Berlin.

....between array construction and array subscription. In the FFT example we could not gain efficiency by using array construction, other than for storing precomputed data like the input. Using array subscription improves performance. 1 Introduction Lazy functional languages like Haskell [8] and Tale [1] offer lazy linear arrays as a primitive data structure as well as a set of built in functions to operate on such arrays. Other languages, such as Miranda [11] do not provide arrays. The data structure that comes naturally with (lazy) functional languages is the list. It is essentially a linear ....

H. P. Barendregt and M. van Leeuwen. Functional programming and the language Tale. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current trends in concurrency: overviews and tutorials, LNCS 224, pages 122--208, Noordwijkerhout, The Netherlands, Jun 1985. Springer-Verlag, Berlin.

....Sea over a number of time steps. The monolithic version of qs is taken from Wadler s paper [11] the incremental version originates from Hudak s paper [12] The fft and wv programs will be described in the following sections. The array primitives being used are borrowed from the languages Tale [13] and Haskell [14] Angular brackets are used here to denote an array thus: ha l : a u i. All arrays are accompanied by a descriptor pair (l; u) which holds the lower bound l and the upper bound u of the array. Here are two examples of array primitives. The first is the function tabulate, ....

H. P. Barendregt and M. van Leeuwen. Functional programming and the language Tale. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current trends in concurrency: overviews and tutorials, LNCS 224, pages 122--208, Noordwijkerhout, The Netherlands, Jun 1985. Springer-Verlag, Berlin.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC