@Article{         Statman,
  Author        = "Statman, R.",
  Abstract      = "We give a complete self-contained proof of Statman's finite completeness theoremand of a corollary of this theorem stating that the -definability conjectureimplies the higher-order matching conjecture.Keywords: simply typed lambda-calculus, finite model, lambda-definability,higher-order matchingThe purpose of this note is to give a complete self-contained proof ofStatman's finite completeness theorem and of a corollary of this theoremstating that the -definability conjecture implies the higher-order matchingconjecture. Both results are proved in {$[$}8{$]$} (theorem 2 and 5). Although, since{$[$}8{$]$} assumes some familiarity with typed -calculus model theory and presentsseveral results in short space, it may be not very accessible to readers notfamiliar with this subject.Section 1 gives the basic notations used in the paper. The reader notfamiliar with simply typed -calculus should consult Hindley and Seldin {$[$}3{$]$}.Section 2 presents standard models for simply typed -calculus, it is...",
  Address       = "School of Computer Science; Carnegie Mellon University",
  copyright     = "Copyright {\copyright} 1982 Association for Symbolic Logic",
  date-added    = "2013-02-15 16:48:28 +0000",
  date-modified = "2013-02-15 16:53:25 +0000",
  ISSN          = "00224812",
  Journal       = "The Journal of Symbolic Logic",
  jstor_formatteddate="Mar., 1982",
  Keywords      = "lambda calculus",
  Language      = "English",
  Number        = "1",
  Pages         = "pp. 17-26",
  Publisher     = "Association for Symbolic Logic",
  Title         = "Completeness, Invariance and {$\lambda$}-Definability",
  ty            = "JOUR",
  URL           = "http://www.jstor.org/stable/2273377",
  Volume        = "47",
  Year          = "1982",
  bdsk-url-1    = "http://www.jstor.org/stable/2273377",
  File          = "Completeness, Invariance and {$\lambda$}-Definability - Statman (0) (0) - a - a - a.pdf"
}

@Article{ Statman, Author = "Statman, R.", Abstract = "We give a complete self-contained proof of Statman's finite completeness theoremand of a corollary of this theorem stating that the -definability conjectureimplies the higher-order matching conjecture.Keywords: simply typed lambda-calculus, finite model, lambda-definability,higher-order matchingThe purpose of this note is to give a complete self-contained proof ofStatman's finite completeness theorem and of a corollary of this theoremstating that the -definability conjecture implies the higher-order matchingconjecture. Both results are proved in {$[$}8{$]$} (theorem 2 and 5). Although, since{$[$}8{$]$} assumes some familiarity with typed -calculus model theory and presentsseveral results in short space, it may be not very accessible to readers notfamiliar with this subject.Section 1 gives the basic notations used in the paper. The reader notfamiliar with simply typed -calculus should consult Hindley and Seldin {$[$}3{$]$}.Section 2 presents standard models for simply typed -calculus, it is...", Address = "School of Computer Science; Carnegie Mellon University", copyright = "Copyright {\copyright} 1982 Association for Symbolic Logic", date-added = "2013-02-15 16:48:28 +0000", date-modified = "2013-02-15 16:53:25 +0000", ISSN = "00224812", Journal = "The Journal of Symbolic Logic", jstor_formatteddate="Mar., 1982", Keywords = "lambda calculus", Language = "English", Number = "1", Pages = "pp. 17-26", Publisher = "Association for Symbolic Logic", Title = "Completeness, Invariance and {$\lambda$}-Definability", ty = "JOUR", URL = "http://www.jstor.org/stable/2273377", Volume = "47", Year = "1982", bdsk-url-1 = "http://www.jstor.org/stable/2273377", File = "Completeness, Invariance and {$\lambda$}-Definability - Statman (0) (0) - a - a - a.pdf" }