Complexity of Type Inference

  • Authors:

  • Jerzy Tyszkiewicz

  • Affiliations:

  • (Correspd.) Institute of Informatics, University of Warsaw, Banacha 2, 02-097 Warsaw, Poland. J.Tyszkiewicz@mimuw.edu.pl

  • Venue:
  • Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper contains the English version of my Master's thesis [6] written about 22 years ago under supervision of Jerzy Tiuryn. Its main result is the proof of PTIME-completeness of the type reconstruction problem for simply typed lambda calculus. About the time I had the English paper ready, a much simpler proof [3] by John Mitchell (later published in [4]) was announced. Therefore my thesis remained an unpublished manuscript, but has been referenced to in a number of other papers. The TEX sources went lost in the meantime, so the present paper has been re-typed from scratch, but is almost identical to the original one written many years ago.