ON THE TYPE CORRECTNESS OF POLYMORPHIC $\lambda$-TERMS. 2

A. H. Arakelyan

doi:10.46991/PYSU:A/2010.44.1.037

ON THE TYPE CORRECTNESS OF POLYMORPHIC $\lambda$-TERMS. 2

Authors

A. H. Arakelyan Chair of Programming and Information Thechnologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSU:A/2010.44.1.037

Keywords:

type, term, constraint, skeleton, expansion, principal typing

Abstract

In this paper the polymorphic lambda terms are considered, where no type information is provided for the variables. The aim of this work is to prove that presented typification algorithm [1] typifies such terms in most common way.

Downloads

Published

2010-01-26

How to Cite

Arakelyan, A. H. (2010). ON THE TYPE CORRECTNESS OF POLYMORPHIC $\lambda$-TERMS. 2. Proceedings of the YSU A: Physical and Mathematical Sciences, 44(1 (221), 37–46. https://doi.org/10.46991/PYSU:A/2010.44.1.037