Entry Revesz:1998:ETR from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Revesz:1998:ETR,
  author =       "Gyorgy E. Revesz",
  title =        "Experimenting with tail-recursion and simulating
                 coroutines",
  journal =      j-SIGCSE,
  volume =       "30",
  number =       "4",
  pages =        "51--54",
  month =        dec,
  year =         "1998",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/306286.306315",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:56:35 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "The efficiency of tail recursion and the simplicity of
                 its removal makes some people wonder why we cannot
                 transform all recursive definitions to this form?
                 Clearly, the usual trick of introducing a new variable
                 and using it as an accumulator to hold the intermediate
                 results during the winding phase does not always work.
                 But, by trying to generalize this technique to
                 primitive recursion one can easily find a sufficient
                 condition which makes it work. The class of functions
                 satisfying this condition may be interesting also on
                 its own. A direct generalization of this function class
                 for mutual recursion is fairly straightforward.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries