Type-Theory of Acyclic Algorithms with Generalised Immediate Terms
Roussanka Loukanova
2019
Abstract
The paper extends the higher-order, type-theory Lλ ar of acyclic algorithms by classifying some explicit terms as generalised immediate terms. We introduce a restricted, specialised iβ-rule and reduction of generalised immediate terms to their iβ-canonical forms. Then, we incorporate the iβ-rule in the reduction calculus of Lλ ar. The new reduction calculus provides more efficient algoritms for computation of values of terms, by using iterative calculations.
DownloadPaper Citation
in Harvard Style
Loukanova R. (2019). Type-Theory of Acyclic Algorithms with Generalised Immediate Terms.In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-350-6, pages 746-754. DOI: 10.5220/0007410207460754
in Bibtex Style
@conference{icaart19,
author={Roussanka Loukanova},
title={Type-Theory of Acyclic Algorithms with Generalised Immediate Terms},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2019},
pages={746-754},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007410207460754},
isbn={978-989-758-350-6},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Type-Theory of Acyclic Algorithms with Generalised Immediate Terms
SN - 978-989-758-350-6
AU - Loukanova R.
PY - 2019
SP - 746
EP - 754
DO - 10.5220/0007410207460754