ON PROCEDURAL SEMANTICS OF STRONG TYPED FUNCTIONAL PROGRAMS

Authors

  • R. Yu. Hakopian Chair of Programming and Information Technologies, YSU, Armenia

DOI:

https://doi.org/10.46991/PYSUA.2008.42.3.059

Keywords:

procedural semantics, interpretation algorithms, one-step β-reduction, one-step δ-reduction

Abstract

The paper is devoted to procedural semantics of strong typed functional programs that are based on interpretation algorithms. These algorithms use three operations: substitution, one-step β-reduction and one-step δ-reduction. It is proved that the procedural semantics, based on any of such algorithms are consistent. It is also proved that procedural semantics, based on sevеral interpretation algorithms are incomparable.

References

Downloads

Published

2023-10-06

Issue

Vol. 42 No. 3 (217) (2008)

Section

Informatics

License

Copyright (c) 2023 Proceedings of the YSU

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite

Hakopian, R. Y. (2023). ON PROCEDURAL SEMANTICS OF STRONG TYPED FUNCTIONAL PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 42(3 (217), 59-69. https://doi.org/10.46991/PYSUA.2008.42.3.059