Entry Lassez:1984:CFS from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | 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{Lassez:1984:CFS,
  author =       "J.-L. Lassez and M. J. Maher",
  title =        "Closures and fairness in the semantics of programming
                 logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "29",
  number =       "1--2",
  pages =        "167--184",
  month =        mar,
  year =         "1984",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
                 Vic., Australia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "closures; fair chaotic interactions; fair SLD
                 resolution; fixed point theorem; parallel processing;
                 programming logic; programming theory; semantics",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries