Entry Coppo:1984:CTA 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{Coppo:1984:CTA,
  author =       "M. Coppo",
  title =        "Completeness of type assignment in continuous lambda
                 models",
  journal =      j-THEOR-COMP-SCI,
  volume =       "29",
  number =       "3",
  pages =        "309--324",
  month =        apr,
  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 = "C4230B (Combinatorial switching theory)",
  corpsource =   "Dipartimento di Informatica, Univ. di Torino, Torino,
                 Italy",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "calculus; combinatorial switching; completeness;
                 completeness proof; continuous lambda models; Curry's
                 rules; fixed point combinator; pure lambda-calculus;
                 syntactic nature; type assignment",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries