W. H. Burge. Stream processing functions. IBM Journal of Research and Development, 19(1):12--25, January 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Stream elements are thus evaluated when they are come to calculation of each successive loop control value and execution of the loop body proceed in an interleaved manner. Burge further developed the idea of streams, as a way of structuring programs as a set of independent sub programs [28]. He uses the same representation as Landin, and lists a number of functions that are now standard in functional programming languages: maps applies a function to each element of a stream; generate f x produces the sequence x; f x; f 2 x, and so on; zips produces a stream of pairs from two ....

W. H. Burge. Stream processing functions. IBM Journal of Research and Development, 19(1):12--25, January 1975.

....Stream elements are thus evaluated when they are come to calculation of each successive loop control value and execution of the loop body proceed in an interleaved manner. Burge further developed the idea of streams, as a way of structuring programs as a set of independent sub programs [28]. He uses the same representation as Landin, and lists a number of functions that are now standard in functional programming languages: maps applies a function to each element of a stream; generate f x produces the sequence x; f x; f 2 x, and so on; zips produces a stream of pairs from two ....

W. H. Burge. Stream processing functions. IBM Journal of Research and Development, 19(1):12--25, January 1975. BIBLIOGRAPHY 197

....x9. contains some concluding remarks. Along the way we give some very simple programming and proving examples to provide basic intuitions about the various program primitives and reasoning principles. Many more examples of programming and proving with functions, control, and memory can be found in (Burge 1975); Talcott 1985 1989, 1992) Felleisen 1987, 1988) Mason 1986) Mason and Talcott 1990, 1991a, 1991b, 1992, 1994a, 1994b) Examples include: higher order functionals as generic program modules; manipulating mutable lists; stream processing; co routines; and objects as functions (lambda ....

Burge, W. H. (1975). Stream processing functions. IBM Journal of Research and Development 19, 12--25.

....and that provides a useful starting point for any further reading the reader may wish to undertake. Some of the topics covered in our overview are analysed in more depth in the following sections. 2. 1 The 1960s Within computer science the term stream has been attributed to P J Landin (see [50]) formulated during the development of operational constructs presented as part of his work on the correspondence between ALGOL 60 and the calculus (see [138] and [139] Indeed, we note that P J Landin s original use for streams was to model the histories of loop variables, but he also observed ....

....programming language designed for representing SPSs using a fixed point semantics. The use of a fixed point semantics for SPSs in the style of Kahn s work is common, and for this reason SPSs are sometimes referred to as Kahn networks. 2 A BRIEF HISTORY OF STREAM PROCESSING 4 In 1975 W Burge (see [50]) discussed the use of streams as a method for structured programming and introduced a set of functional stream primitives for this purpose. In 1976 P Henderson and J H Morris (see [100] and D P Friedman and D S Wise (see [78] published their work on lazy evaluation techniques that are useful ....

W H Burge. Stream Processing Functions. IBM Journal of Research and Development, pages 12--25, 1975.

....that provides a useful starting point for any further reading the reader may wish to undertake. Research topics that we believe are most important are analysed in more depth in the following sections. 3. 1 The 1960s Within computer science the term stream has been attributed to P J Landin (see [42]) formulated during his work on the correspondence between ALGOL 60 and the calculus (see [99] and [98] The first type of SPSs that can be identified within the literature are dataflow systems that have certainly existed, although not always under the name dataflow , as early as the late 1960s ....

....work outlining a simple parallel programming language designed for representing SPSs using a fixed point semantics. The use of a fixed point semantics for SPSs in the style of Kahn s work is common, and for this reason SPSs are sometimes referred to as Kahn networks. In 1975 W Burge (see [42]) discussed the use of streams as a method for structured programming and introduced a set of functional stream primitives for this purpose. In 1976 P Henderson and J H Morris (see [78] and D P Friedman and D S Wise (see [63] published their work on lazy evaluation techniques that are useful for ....

W H Burge. Stream Processing Functions. IBM Journal of Research and Development, pages 12--25, 1975.

....not support data stream computations, but many languages support structures similar to data streams, such structures include lists or dynamic vectors. Functional programming languages, particularly those supporting lazy evaluation, can quite naturally implement data stream computations using lists [11]. Lisp, another language with strong list processing support, can also comfortably and profitably implement data stream computations [2] The interest in iterators in object oriented languages indicates of the value of having data stream like computations [27] also, the difficulty of implementing ....

W. H. Burge. Stream processing functions. IBM Journal of Research and Development, 19(1):12--25, January 1975.

....A good introduction to coroutines, along with a brief history, is that by Knuth. 5] The search for programming languages that effectively express the parallelism inherent in an algorithm (i.e. non operational languages) provided further impetus for the development of the stream mechanism. 6][7] The ability of a stream to provide a method for formally representing variables that change dynamically over time was used in several seminal declarative (or applicative) programming languages such as DFPL, VAL and Lucid. 8] 9] 10] 11] The stream definition used was typically an ordered sequence ....

W. H. Burge, "Stream Processing Functions," IBM Journal of Research and Development, 19, Jan. 1975, pp. 12-25.

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