Entry Murakami:1990:DSF from tcs1990.bib

Last update: Wed Sep 26 02:11:46 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{Murakami:1990:DSF,
  author =       "M. Murakami",
  title =        "A declarative semantics of flat guarded {Horn} clauses
                 for programs with perpetual processes",
  journal =      j-THEOR-COMP-SCI,
  volume =       "75",
  number =       "1-2",
  pages =        "67--83",
  day =          "25",
  month =        sep,
  year =         "1990",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory); C6140D (High level languages)",
  conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988",
  conftitle =    "International Conference on Fifth Generation Computer
                 Systems 1988",
  corpsource =   "Inst. for New Generation Comput. Technol., Tokyo,
                 Japan",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "concurrent programming language; declarative
                 semantics; flat GHC; flat guarded Horn clauses; formal
                 logic; goal clauses; greatest fixpoint; guard-commit
                 mechanisms; guarded clauses; high level languages; I/O
                 histories; input/output; logic programming; maximum
                 model; parallel programming; perpetual computation;
                 perpetual processes; programming theory; truth",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries