Entry Thatte:1989:FAL from tcs1985.bib

Last update: Thu Sep 27 02:46:57 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{Thatte:1989:FAL,
  author =       "Satish R. Thatte",
  title =        "Full abstraction and limiting completeness in
                 equational languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "65",
  number =       "1",
  pages =        "85--119",
  day =          "15",
  month =        jun,
  year =         "1989",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Michigan",
  affiliationaddress = "Ann Arbor, MI, USA",
  classification = "723; C4210 (Formal logic)",
  corpsource =   "Dept. of Electr. Eng. and Comput. Sci., Michigan
                 Univ., Ann Arbor, MI, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  journalabr =   "Theor Comput Sci",
  keywords =     "coherent computable models; Computer Metatheory;
                 Computer Programming Languages; design principle;
                 Equational Languages; equational languages; formal
                 languages; full abstraction; Full Abstraction; fully
                 abstract model; information systems; limiting
                 completeness; Limiting Completeness; regular systems;
                 Semantics; Theory",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries