Object

Title: On Dependence of Interpretation Algorithms of Typed Functional Programs on Canonical Notion of δ-Reduction

Other title:

Տիպիզացված ֆունկցիոնալ ծրագրերի ինտերպրետացիայի ալգորիթմների կախվածությունը կանոնիկ δ-ռեդուկցիայի գաղափարից; О зажисимости алгоритмов интерпретации типизирванных функциональных программ от канонического понятия δ-редукции

Coverage:

103-109

Abstract:

In this paper the interpretation algorithms of typed functional programs are considered. The interpretation algorithm is based on substitutions, ß-reduction and canonical ±-reduction. The basic semantics of typed functional program is a function with indeterminate values of arguments, which is the main component of its least solution. If the value of the basic semantics for some values of arguments is indeterminate, then the value ┴, or works endlessly. It is shown that seven known interpretation algorithms are ┴-depend on canonical notion of ┴-reduction. Here are these 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).

Publisher:

НАН РА

Date created:

2018-02-22

Format:

pdf

Identifier:

oai:arar.sci.am:258964

Journal or Publication Title:

НАН РА. Математические вопросы кибернетики и вычислительной техники=Mathematical problems of computer science

Date of publication:

2018

Volume:

49

ISSN:

0131-4645

Additional Information:

Գրիգորյան Դ., Григорян Д.

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Object collections:

Last modified:

Aug 27, 2020

In our library since:

Jul 24, 2020

Number of object content hits:

0

All available object's versions:

https://arar.sci.am/publication/282103

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information