Paper available by ftp

• To: types@dcs.gla.ac.uk
• Subject: Paper available by ftp
• From: loader@maths.ox.ac.uk (Ralph Loader)
• Date: Wed, 23 Jun 93 11:53:09 +0100
• Approved: types@dcs.gla.ac.uk

The following is available by anonymous FTP from theory.doc.ic.ac.uk
in directory /theory/papers/Loader/ in the files define.dvi and define.ps.Z

`The Undecidability of Lambda Definability'
by R. Loader

Abstract. I show that in a model of the simply typed lambda calculus
which is finite at each type, the problem of deciding whether a given
object is definable by a term, is undecidable. (This (or rather its
negation) is known as the Statman-Plotkin conjecture.)  This is done
by encoding word problems.

• Prev: CFP: Special Issue of LASC
• Next: Conference - Theor. Aspects Computer Software (TACS) 1994
• Index(es):
  • Main
  • Thread