loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Roussanka Loukanova 1 ; 2

Affiliations: 1 Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Block 8, 1113 Sofia, Bulgaria ; 2 Stockholm University, Stockholm, Sweden

Keyword(s): Algorithms, Acyclic Recursion, Type Theory, Reduction Calculi, Canonical Forms, Eta-reduction.

Abstract: The paper extends the standard reduction calculus of the higher-order Type-theory of Acyclic Recursion to η-reduction. This is achieved by adding a restricted η-rule, which is applicable only to terms in canonical forms satisfying certain conditions. Canonical forms of terms determine the iterative algorithms for computing the semantic denotations of the terms. Unnecessary λ-abstractions and corresponding functional applications in canonical forms contribute to algorithmic complexity. The η-rule provides a simple way to reduce complexity by maintenance of essential algorithmic structure of computations.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.216.121.55

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Loukanova, R. (2020). Algorithmic Eta-reduction in Type-theory of Acyclic Recursion. In Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-395-7; ISSN 2184-433X, SciTePress, pages 1003-1010. DOI: 10.5220/0009182410031010

@conference{icaart20,
author={Roussanka Loukanova.},
title={Algorithmic Eta-reduction in Type-theory of Acyclic Recursion},
booktitle={Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2020},
pages={1003-1010},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009182410031010},
isbn={978-989-758-395-7},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Algorithmic Eta-reduction in Type-theory of Acyclic Recursion
SN - 978-989-758-395-7
IS - 2184-433X
AU - Loukanova, R.
PY - 2020
SP - 1003
EP - 1010
DO - 10.5220/0009182410031010
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic