Gamma-star Reduction in the Type-theory of Acyclic Algorithms

Roussanka Loukanova

Abstract

The paper extends a higher-order type theory of acyclic algorithms by adding a reduction rule, which results in a stronger reduction calculus. The new reduction calculus determines a strong algorithmic equivalence between formal terms. It is very useful for simplifying terms, by eliminating sub-terms having superfluous lambda abstraction and corresponding spurious functional applications.

References

Download


Paper Citation


in Harvard Style

Loukanova R. (2018). Gamma-star Reduction in the Type-theory of Acyclic Algorithms.In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-275-2, pages 231-242. DOI: 10.5220/0006662802310242


in Bibtex Style

@conference{icaart18,
author={Roussanka Loukanova},
title={Gamma-star Reduction in the Type-theory of Acyclic Algorithms},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2018},
pages={231-242},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006662802310242},
isbn={978-989-758-275-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Gamma-star Reduction in the Type-theory of Acyclic Algorithms
SN - 978-989-758-275-2
AU - Loukanova R.
PY - 2018
SP - 231
EP - 242
DO - 10.5220/0006662802310242