Entry Slonneger:1995:ESM 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{Slonneger:1995:ESM,
  author =       "Ken Slonneger",
  title =        "Executing an {SECD} machine using logic programming",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "1",
  pages =        "228--232",
  month =        mar,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/199691.199793",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:28 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Students usually find formal methods of describing
                 programming languages very difficult because of the
                 cryptic notation, the complexity of the techniques, and
                 the size of the specifications. The SECD abstract
                 machine provides a small but clear description of the
                 operational semantics of the lambda calculus. By
                 implementing the SECD machine in Prolog, we give
                 students a tool for testing specifications and for
                 experimenting with alternate language semantics in an
                 interactive setting.",
  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