In this paper, I introduce the extended type-theory of acyclic algorithms L-ar(lambda) and its version L-r(lambda) with full recursion. The extended theory and its reduction calculus provide algorithmic semantics of a...
详细信息
ISBN:
(数字)9783031608780
ISBN:
(纸本)9783031608773;9783031608780
In this paper, I introduce the extended type-theory of acyclic algorithms L-ar(lambda) and its version L-r(lambda) with full recursion. The extended theory and its reduction calculus provide algorithmic semantics of attitude expressions, including beliefs, knowledge, and statements, which are present in advanced applications requiring computational semantics of natural language. The extended type-theory of algorithms includes restrictor terms, terms of logic operators, and pure quantifiers. The restrictor terms have effects of presuppositional restrictions, requiring objects to have certain properties. I provide brief, while important information on the relation of the theory of recursion L-r(lambda) to the formal language LCF of lambda-calculus, by Dana S. Scott and Gordon Plotkin, covering let-expressions for semantics of programming langages.
In this work, I introduce the Type-Theory of algorithms (TTA), which is an extension of Moschovakis Type-Theory of algorithms and its reduction calculus, by adding logic operators and quantifiers. The formal language ...
详细信息
ISBN:
(数字)9783031439773
ISBN:
(纸本)9783031439766;9783031439773
In this work, I introduce the Type-Theory of algorithms (TTA), which is an extension of Moschovakis Type-Theory of algorithms and its reduction calculus, by adding logic operators and quantifiers. The formal language has two kinds of terms of formulae, for designating state-independent and state-dependent propositions and predications. The logic operators include conjunction, disjunction, conditional implication, and negation. I add state-dependent quantifiers, for enhancing the standard quantifiers of predicate logic. I provide an extended reduction calculus of the Type-Theory of acyclic algorithms, for reductions of terms to their canonical forms. The canonical forms of the terms provide the algorithmic semantics for computing the denotations.
暂无评论