Entry Anonymous:1990:CCA 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{Anonymous:1990:CCA,
  author =       "Anonymous",
  title =        "{CAAP} '88 --- 13th Colloque sur les Arbres en
                 Alg{\`e}bre et en Programmation. ({French})
                 [{Colloquium} on Trees in Algebra and Programming]",
  journal =      j-THEOR-COMP-SCI,
  volume =       "72",
  number =       "2-3",
  pages =        "??--??",
  day =          "23",
  month =        may,
  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 = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  conflocation = "Nancy, France; 21-25 March 1988",
  conftitle =    "CAAP '88 --- 13th Colloque sur les Arbres en Algebre
                 et en Programmation (Colloquium on Trees in Algebra and
                 Programming)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "A/sup 2/CCS; algebra; algorithm theory; atomic actions
                 for CCS; AVL trees; combinatory differential fields;
                 complexity; Dactl; data structures; directed
                 hypergraphs; dynamic algorithms; equational completion;
                 formal logic; functional languages; Hennessy--Milner
                 Logic; logic programming; narrowing strategies;
                 order-sorted algebras; parallelism; path length; proof
                 systems; recursion; rewrite based algebraic
                 specifications; rewriting systems; satisfiability;
                 specification languages; term rewrite languages; trees
                 (mathematics)",
  language =     "French",
  pubcountry =   "Netherlands",
  sponsororg =   "AFCET; BCS; GI",
  treatment =    "T Theoretical or Mathematical",
}

Related entries