Entry Mayr:1998:HOR from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                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{Mayr:1998:HOR,
  author =       "Richard Mayr and Tobias Nipkow",
  title =        "Higher-order rewrite systems and their confluence",
  journal =      j-THEOR-COMP-SCI,
  volume =       "192",
  number =       "1",
  pages =        "3--29",
  day =          "10",
  month =        feb,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:21:33 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=192&issue=1;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/192/1/2679.pdf",
  acknowledgement = ack-nhfb,
  classification = "C4210L (Formal languages and computational
                 linguistics)",
  corpsource =   "Inst. fur Inf., Tech. Univ. Munchen, Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bound variables; confluence; critical pair lemma;
                 higher-order rewrite systems; inference mechanisms;
                 lambda calculus; lambda terms; pattern rewrite systems;
                 rewriting module equations; rewriting systems; term
                 rewriting; undirected equational reasoning",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries