|
Proceedings of the Yerevan State University, series Physical and Mathematical Sciences, 2010, Issue 1, Pages 37–46
(Mi uzeru202)
|
|
|
|
Informatics
On the type correctness of polymorphic $\lambda$-terms. 2
A. H. Arakelyan Chair of Programming and Information Technologies YSU, Armenia
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.
Keywords:
type, term, constraint, skeleton, expansion, principal typing.
Received: 06.04.2010 Accepted: 12.05.2010
Citation:
A. H. Arakelyan, “On the type correctness of polymorphic $\lambda$-terms. 2”, Proceedings of the YSU, Physical and Mathematical Sciences, 2010, no. 1, 37–46
Linking options:
https://www.mathnet.ru/eng/uzeru202 https://www.mathnet.ru/eng/uzeru/y2010/i1/p37
|
Statistics & downloads: |
Abstract page: | 59 | Full-text PDF : | 18 | References: | 17 |
|