Entry Ben-Ari:1996:SEL 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{Ben-Ari:1996:SEL,
  author =       "Mordechai Ben-Ari",
  title =        "Structure exits, not loops",
  journal =      j-SIGCSE,
  volume =       "28",
  number =       "3",
  pages =        "51",
  month =        sep,
  year =         "1996",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/234867.234878",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:35 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Until recently, Pascal was the first programming
                 language taught to students. As more schools choose Ada
                 or C++ as a first language, the debate on structured
                 programming has been reopened ([Rob95]). We are no
                 longer restricted to the while-statement:
                 exit/break-statements can be used to exit a loop from
                 the middle, and return from a procedure or function is
                 allowed within a loop statement. Do these constructs
                 violate the principle of structure programming? This
                 article claims that more general loop constructs can be
                 objectively justified, because they simplify the
                 verification of programs. A program that is simple to
                 verify is also easy to explain and understand.",
  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