Logic in Computer Science (LICS 2002)

Paper: On the lambda Y calculus (at LICS 2002)

Authors: Richard Statman

Abstract

We show that the word problem for the lambda Y calculus is undecidable + related results

BibTeX

  @InProceedings{Statman-OnthelambdaYcalculu,
    author = 	 {Richard Statman},
    title = 	 {On the lambda Y calculus},
    booktitle =  {Proceedings of the Seventeenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2002},
    year =	 2002,
    editor =	 {Gordon Plotkin},
    month =	 {July}, 
    location =   {Copenhagen, Denmark}, 
    publisher =	 {IEEE Computer Society Press}
  }