2017; Physical and Mathematical Sciences, 51(1 (242): 46–52
Shared with The Gufo

ON CANONICAL NOTION OF δ-REDUCTION AND ON TRANSLATION OFTYPEDλ-TERMS INTO UNTYPED λ-TERMS

Tigran Khondkaryan*

Received: 2025-02-06 · Published: 2017-03-20

© 2017 The Author(s) and the original publisher.

CC BY-NC 4.0 This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Shared article.
Original title
ON CANONICAL NOTION OF δ-REDUCTION AND ON TRANSLATION OFTYPEDλ-TERMS INTO UNTYPED λ-TERMS
Author
Tigran Khondkaryan
Published
2017-03-20
Licence
Creative Commons Attribution-NonCommercial 4.0 International
Original
https://doi.org/10.46991/PYSU:A/2017.51.1.046

Abstract

In the paper typed and untyped λ-terms are considered. Typed λ-terms use variablesof any order and constants of order ≤1. Constants of order 1 are strong computablefunctions with indeterminate values of arguments and every function has an untyped λ-term that λ-defines it. The so-called canonical notion of δ-reduction is introduced.This is the notion of δ-reduction that is used in the implementation of functionalprogramming languages. For the canonical notion of δ-reduction the translation of typed λ-terms into untyped λ-terms is studied.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates