Entry Waters:1991:ATS from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Waters:1991:ATS,
  author =       "Richard C. Waters",
  title =        "Automatic Transformation of Series Expressions into
                 Loops",
  journal =      j-TOPLAS,
  volume =       "13",
  number =       "1",
  pages =        "52--98",
  month =        jan,
  year =         "1991",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib;
                 Misc/IMMD_IV.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/102806.html",
  abstract =     "The benefits of programming in a functional style are
                 well known. In particular, algorithms that are
                 expressed as compositions of functions operating on
                 sequences/vectors/streams of data elements are easier
                 to understand and modify than equivalent algorithms
                 expressed as loops. Unfortunately, this kind of
                 expression is not used anywhere near as often as it
                 could be, for at least three reasons: (1) most
                 programmers are less familiar with this kind of
                 expression than with loops; (2) most programming
                 languages provide poor support for this kind of
                 expression; and (3) when support is provided, it is
                 seldom efficient.\par

                 In any programming language, the second and third
                 problems can be largely solved by introducing a data
                 type called {\em series}, a comprehensive set of
                 procedures operating on series, and a preprocessor (or
                 compiler extension) that automatically converts most
                 series expressions into efficient loops. A set of
                 restrictions specifies which series expressions can be
                 optimized. If programmers stay within the limits
                 imposed, they are guaranteed of high efficiency at all
                 times.\par

                 A common Lisp macro package supporting series has been
                 in use for some time. A prototype demonstrates that
                 series can be straightforwardly supported in Pascal.",
  acknowledgement = ack-nhfb # " and " # ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; design; languages",
  subject =      "{\bf I.2.2}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Automatic Programming, Program
                 transformation. {\bf D.1.1}: Software, PROGRAMMING
                 TECHNIQUES, Applicative (Functional) Programming. {\bf
                 D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Data types and structures.
                 {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Control structures. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors.",
}

Related entries