Logic in Computer Science (LICS 1994)

Paper: The emptiness problem for intersection types (at LICS 1994)

Authors: Pawel Urzyczyn

Abstract

We prove that it is undecidable whether a given intersection type is non-empty, i.e., whether there exists a closed term of this type

BibTeX

  @InProceedings{Urzyczyn-Theemptinessproblem,
    author = 	 {Pawel Urzyczyn},
    title = 	 {The emptiness problem for intersection types},
    booktitle =  {Proceedings of the Ninth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1994},
    year =	 1994,
    editor =	 {Samson Abramsky},
    month =	 {July}, 
    pages =      {300--309},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }