论文信息 - A Type Driven Theory of Predication with Complex Types

A Type Driven Theory of Predication with Complex Types

This paper investigates several models of the complex type • which is needed to analyze copredication. Previous accounts are shown to be inadequate and a new account both of • and copredication is proposed.

Nicholas Asher | Nicholas Asher

[1] Aarne Ranta,et al. Grammatical Framework , 2004, Journal of Functional Programming.

[2] Klaus Aehlig,et al. A syntactical analysis of non-size-increasing polynomial time computation , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[3] James Pustejovsky,et al. The Generative Lexicon , 1995, CL.

[4] Giuseppe Longo,et al. Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[5] Ted Briscoe,et al. Order independent and persistent typed default unification , 1996 .

[6] Robin Cooper,et al. Do delicious lunches take a long time , 2005 .

[7] Uwe Reyle,et al. From discourse to logic , 1993 .

[8] Nicholas Asher,et al. NEGATIVE BIAS IN POLAR QUESTIONS , 2005 .

[9] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[10] Alex Lascarides,et al. Indirect Speech Acts , 2001, Synthese.

[11] S Carlota,et al. Dowty, David. 1979. Word Meaning and Montague Grammar: The Semantics of Verbs and Times in Generative Semantics and in Montague's PTQ. Dordrecht: Reidel. , 2005 .

[12] Paul Sabatier,et al. A Web of Words: Lexical Meaning in Context , 2007 .

[13] J. Lambek,et al. Introduction to higher order categorical logic , 1986 .

[14] Ted Briscoe,et al. Semi-productive Polysemy and Sense Extension , 1995, J. Semant..