Entry Tick:1994:DTN 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{Tick:1994:DTN,
  author =       "E. Tick and M. Korsloot",
  title =        "Determinacy Testing for Nondeterminate Logic
                 Programming Languages",
  journal =      j-TOPLAS,
  volume =       "16",
  number =       "1",
  pages =        "3--34",
  month =        jan,
  year =         "1994",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/174626.html",
  abstract =     "This paper describes an algorithm for the code
                 generation of determinacy testing for nondeterminate
                 flat concurrent logic programming languages. Languages
                 such as Andorra and Pandora require that procedure
                 invocations suspend if there is more than one candidate
                 clause potentially satisfying the goal. The algorithm
                 described has been developed specifically for a variant
                 of flat Pandora based on FGHC, although the concepts
                 are general. We have extended Kliger and Shapiro's
                 decision-graph construction algorithm to compile
                 ``don't-know'' procedures that must suspend for
                 nondeterminate goal invocation. The determinacy test is
                 compiled into a decision graph quite different from
                 those of committed-choice procedures: They are more
                 similar to decision trees optimized by code sharing. We
                 present both empirical data of compilation results
                 (code size and graph characteristics), and a
                 correctness proof for our code-generation algorithm.",
  acknowledgement = ack-nhfb # " and " # ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; languages; performance",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Code generation. {\bf D.1.6}: Software,
                 PROGRAMMING TECHNIQUES, Logic Programming. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Applicative languages. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Concurrent, distributed, and parallel
                 languages. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Compilers. {\bf D.3.4}:
                 Software, PROGRAMMING LANGUAGES, Processors,
                 Optimization.",
}

Related entries