Entry Yu:1997:NCI 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{Yu:1997:NCI,
  author =       "Ting Yu and Owen Kaser",
  title =        "A note on ``On the conversion of indirect to direct
                 recursion''",
  journal =      j-TOPLAS,
  volume =       "19",
  number =       "6",
  pages =        "1085--1087",
  month =        nov,
  year =         "1997",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Mar 11 18:11:48 MST 1998",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/toplas/1997-19-6/p1085-yu/",
  abstract =     "In the article ``On the conversion of indirect to
                 direct recursion''(ACM Lett. Program. Lang. 2, 1-4. pp.
                 151-164), a method was introduced to convert indirect
                 to direct recursion. It was claimed that for any call
                 graph, there is a mutual-recursion elimination sequence
                 if and only if no strongly connected component contains
                 two node-disjoint circuits. We first give a
                 counterexample and then provide a correction.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "theory",
  subject =      "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers.",
}

Related entries