Author:
Roussanka Loukanova
Affiliation:
Stockholm University, Sweden
Keyword(s):
Mathematics Of Algorithms, Recursion, Types, Semantics, Algorithmic Semantics, Denotation, Canonical Computations.
Related
Ontology
Subjects/Areas/Topics:
Agent Communication Languages
;
Agents
;
Applications
;
Artificial Intelligence
;
Cognitive Systems
;
Computational Intelligence
;
Enterprise Information Systems
;
Evolutionary Computing
;
Human-Computer Interaction
;
Intelligent User Interfaces
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation and Reasoning
;
Knowledge-Based Systems
;
Natural Language Processing
;
Pattern Recognition
;
Soft Computing
;
Symbolic Systems
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.