ON THE TYPE CORRECTNESS OF POLYMORPHIC λ-TERMS. 1

Authors

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

DOI:

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

Keywords:

type, term, constraint, skeleton, expansion, typing

Abstract

In this paper polymorphic lambda terms are considered, where no type information is provided for the variables. The aim of this work is to extend the algorithm of typification [1] of such terms introducing type constants and term constants.

Downloads

Published

2009-10-04

How to Cite

Arakelyan, A. H. (2009). ON THE TYPE CORRECTNESS OF POLYMORPHIC λ-TERMS. 1. Proceedings of the YSU A: Physical and Mathematical Sciences, 43(3 (220), 42–51. https://doi.org/10.46991/PYSU:A/2009.43.3.042

Issue

Section

Informatics