Author:
Roussanka Loukanova
Affiliation:
Stockholm University, Stockholm and Sweden
Keyword(s):
Mathematics of Algorithms, Acyclic Recursion, Types, Algorithmic Semantics, Denotation, Immediate Terms, Immediate Denotation, Canonical Form.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation and Reasoning
;
Knowledge-Based Systems
;
Natural Language Processing
;
Pattern Recognition
;
Symbolic Systems
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.