Entry Hagiya:1995:TCP from tcs1995.bib

Last update: Tue Nov 20 02:22:06 MST 2001

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{Hagiya:1995:TCP,
  author =       "Masami Hagiya",
  title =        "A typed $\lambda$-calculus for proving-by-example and
                 bottom-up generalization procedure",
  journal =      j-THEOR-COMP-SCI,
  volume =       "137",
  number =       "1",
  pages =        "3--23",
  day =          "09",
  month =        jan,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975",
  bibdate =      "Mon Jul 19 22:18:44 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1786",
  acknowledgement = ack-nhfb,
  classification = "C1230 (Artificial intelligence); C4210 (Formal
                 logic)",
  conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
  conftitle =    "4th International Workshop, ALT'93. Algorithmic
                 Learning Theory",
  corpsource =   "Dept. of Inf. Sci., Tokyo Univ., Japan",
  keywords =     "bottom-up generalization; bounded quantification;
                 inference mechanisms; inferences; lambda calculus;
                 linear arithmetical terms; logical framework;
                 mathematical inductions; nested inductions;
                 proving-by-example; typed lambda calculus",
  pubcountry =   "Netherlands",
  sponsororg =   "Japanese Soc. Artificial Intelligence",
  treatment =    "T Theoretical or Mathematical",
}

Related entries