Site logo
Natural Science, Biology, 2024, 14, 67–75
DOI: 10.xxxx/example-doi Special Issue 1(2), 2022 186–1928

ON THE TYPE CORRECTNESS OF POLYMORPHIC -TERMS. 2

Received N/A; revised N/A; accepted N/A
CC BY-NC 4.0 This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Subscribe to TheGufo Newsletter​