Entry Frost:1994:UMA from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

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{Frost:1994:UMA,
  author =       "R. A. Frost",
  title =        "Using memoization to achieve polynomial complexity of
                 purely functional executable specifications of
                 non-deterministic top-down parsers",
  journal =      j-SIGPLAN,
  volume =       "29",
  number =       "4",
  pages =        "23--30",
  month =        apr,
  year =         "1994",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:16:49 MST 2003",
  bibsource =    "http://portal.acm.org/",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110
                 (Systems analysis and programming); C6110B (Software
                 engineering techniques); C6140D (High level languages);
                 C6150C (Compilers, interpreters and other processors)",
  corpsource =   "Sch. of Comput. Sci., Windsor Univ., Ont., Canada",
  keywords =     "computational complexity; formal specification;
                 functional programming; functional programming
                 languages; grammars; Haskell; high level languages;
                 LML; memoization; Miranda; mutable object;
                 nondeterministic top-down executable specifications;
                 nondeterministic top-down parsers; polynomial
                 complexity; program compilers; programming theory;
                 purely functional executable specifications; reasoning;
                 referential transparency; simple top-down backtracking
                 parser; top-down backtracking parsers",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries