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

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

Grigoryan, Davit A. (2018) On Dependence of Interpretation Algorithms of Typed Functional Programs on Canonical Notion of δ-Reduction. Математические вопросы кибернетики и вычислительной техники, № 49. pp. 103-109. ISSN 0131-4645

[img]
Preview
PDF
Download (324Kb) | Preview

    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).

    Item Type: Article
    Additional Information: Տիպիզացված ֆունկցիոնալ ծրագրերի ինտերպրետացիայի ալգորիթմների կախվածությունը կանոնիկ δ-ռեդուկցիայի գաղափարից / Դ. Գրիգորյան։ О зажисимости алгоритмов интерпретации типизирванных функциональных программ от канонического понятия δ-редукции / Д. Григорян
    Uncontrolled Keywords: Typed functional program, Canonical δ-reduction, Interpretation algorithm, ┴-dependency.
    Subjects: Q Science > QA Mathematics > Algorithm
    Divisions: UNSPECIFIED
    Depositing User: FSL Bibl. Dept.
    Date Deposited: 24 Oct 2018 14:09
    Last Modified: 25 Oct 2018 11:45
    URI: http://compsci.asj-oa.am/id/eprint/907

    Actions (login required)

    View Item