2018; Physical and Mathematical Sciences, 52(2 (246): 109–118
Shared with The Gufo

ON INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE

David Grigoryan*

Received: 2025-02-04 · Published: 2018-08-15

© 2018 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 INCOMPARABILITY OF INTERPRETATION ALGORITHMS OF TYPED FUNCTIONAL PROGRAMS WITH RESPECT TO UNDEFINED VALUE
Author
David Grigoryan
Published
2018-08-15
Licence
Creative Commons Attribution-NonCommercial 4.0 International
Original
https://doi.org/10.46991/PYSU:A/2018.52.2.109

Abstract

In the paper the interpretation algorithms of typed functional programs are considered. The interpretation algorithm is based on substitution, β-reduction and canonical δ-reduction. It is shown that seven known interpretation algorithms (FS (of full substitution), PES (of parallel external substitution), LES (of left external substitution), PIS (of parallel inner substitution), LIS (of left inner substitution), ACT (active algorithm), PAS (passive algorithm)) are pairwise incomparable with respect to undefined value (⊥-incomparable).
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates