On the lambda Y calculus

Richard Statman

To appear at Symposium on Logic in Computer Science (LICS'2002), Copenhagen, Denmark, July 22nd - 25th, 2002

Abstract

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

Server START Conference Manager
Update Time 15 Mar 2002 at 15:30:29
Maintainer lics02@dcs.ed.ac.uk.
Start Conference Manager
Conference Systems