Accession Number:

ADA256233

Title:

On Statman's Finite Completeness Theorem

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1992-06-01

Pagination or Media Count:

19.0

Abstract:

We give a complete self-contained proof of Statmans finite completeness theorem and of a corollary of this theorem stating that the Lambda- definability conjecture implies the higher-order matching conjecture.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE