Author:
Roussanka Loukanova
Affiliation:
Stockholm University, Sweden
Keyword(s):
Semantics, Algorithms, Intension, Denotation, Recursion, Types, Underspecification, Subtypes, Polymorphism.
Related
Ontology
Subjects/Areas/Topics:
Agent Communication Languages
;
Agents
;
Applications
;
Artificial Intelligence
;
Cognitive Robotics
;
Constraint Satisfaction
;
Conversational Agents
;
Informatics in Control, Automation and Robotics
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Natural Language Processing
;
Pattern Recognition
;
Robotics and Automation
;
Symbolic Systems
;
Uncertainty in AI
Abstract:
The paper extends Moschovakis higher-order type theory of acyclic recursion by adding type polymorphism. We extend the type system of the theory to model parametric information that pertains to underspecified types. Different kinds of type polymorphism are presented via type variables and recursion constructs for alternative, disjunctive type assignments. Based on the new type system, we extend the reduction calculus of the theory of acyclic recursion. We motivate the type polymorphism with examples from English language.