2000 character limit reached
Type-theoretical natural language semantics: on the system F for meaning assembly (1303.3036v1)
Published 12 Mar 2013 in cs.LO, cs.CL, and math.LO
Abstract: This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as a set of people and as a location). The second order typed lambda calculus was shown to be a good framework, and here we discuss how to introduced predefined types and coercive subtyping which are much more natural than internally coded similar constructs. Linguistic applications of these new features are also exemplified.