Algorithmic granularity with constraints

Abstract

We introduce a notion of algorithmic underspecification in the formal language of acyclic recursion. By this concept of underspecification, we represent denotational ambiguity via algorithmic underspecification. Then we introduce two kinds of constraints on possible specifications of underspecified algorithms (1) general acyclicity constraints, and (2) constraints that arise from specific applications of the type theory of acyclic recursion. We use the theory of acyclic recursion to represent semantic ambiguities in human language (HL), which can not be resolved when only partial knowledge is available. We introduce algorithmic underspecification with constraints for fine-granularity specifications via syntax-semantics interfaces. © Springer International Publishing 2013.