ON THE TYPE CORRECTNESS OF POLYMORPHIC -TERMS. 2

Ara Arakelyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Author(s)

Table of Contents

ON THE TYPE CORRECTNESS OF POLYMORPHIC -TERMS. 2

Abstract

Author(s)

Table of Contents

Related Articles

AZIMUTHS RADIATION RISK DEGREE APPRAISAL FOR THE POPULATION LIVING IN AREA OF THE NUCLEAR POWER PLANTS LOCATION

THE KINETICS OF VESICLES SWELLING IN PRESENCE OF TRANSMEMBRANE DIFFERENCE OF POTENTIALS

ON THE TYPE CORRECTNESS OF POLYMORPHIC -TERMS. 2

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter