@Article{         urzyczyn:intersection,
  Author        = "Urzyczyn, Pawel",
  Abstract      = {We study the intersection type assignment system as defined by Barendregt, Coppo and Dezani. For the four essential variants of the system (with and without a universal type and with and without subtyping) we show that the emptiness (inhabitation) problem is recursively unsolvable. That is, there is no effective algorithm to decide if there is a closed term of a given type. It follows that provability in the logic of "strong conjunction" of Mints and Lopez-Escobar is also undecidable.},
  copyright     = "Copyright {\copyright} 1999 Association for Symbolic Logic",
  date-added    = "2013-02-18 13:32:08 +0000",
  date-modified = "2013-06-12 09:55:48 +0000",
  ISSN          = "00224812",
  Journal       = "The Journal of Symbolic Logic",
  jstor_formatteddate="Sep., 1999",
  Keywords      = "type theory and intersection types and inhabitation problem",
  Language      = "English",
  Number        = "3",
  Pages         = "pp. 1195-1215",
  Publisher     = "Association for Symbolic Logic",
  Title         = "The Emptiness Problem for Intersection Types",
  URL           = "http://www.jstor.org/stable/2586625",
  Volume        = "64",
  Year          = "1999",
  bdsk-url-1    = "http://www.jstor.org/stable/2586625",
  File          = "The Emptiness Problem for Intersection Types - Urzyczyn (0) (0) - a - a - t.pdf"
}

@Article{ urzyczyn:intersection, Author = "Urzyczyn, Pawel", Abstract = {We study the intersection type assignment system as defined by Barendregt, Coppo and Dezani. For the four essential variants of the system (with and without a universal type and with and without subtyping) we show that the emptiness (inhabitation) problem is recursively unsolvable. That is, there is no effective algorithm to decide if there is a closed term of a given type. It follows that provability in the logic of "strong conjunction" of Mints and Lopez-Escobar is also undecidable.}, copyright = "Copyright {\copyright} 1999 Association for Symbolic Logic", date-added = "2013-02-18 13:32:08 +0000", date-modified = "2013-06-12 09:55:48 +0000", ISSN = "00224812", Journal = "The Journal of Symbolic Logic", jstor_formatteddate="Sep., 1999", Keywords = "type theory and intersection types and inhabitation problem", Language = "English", Number = "3", Pages = "pp. 1195-1215", Publisher = "Association for Symbolic Logic", Title = "The Emptiness Problem for Intersection Types", URL = "http://www.jstor.org/stable/2586625", Volume = "64", Year = "1999", bdsk-url-1 = "http://www.jstor.org/stable/2586625", File = "The Emptiness Problem for Intersection Types - Urzyczyn (0) (0) - a - a - t.pdf" }