|
Courses and Workshops
|
| Title: | Continuations |
| Lecturer(s): | Chris Barker (University of California, San Diego) and Chung-chieh Shan (Harvard University) |
| Type: | Advanced Course |
| Section: | Logic and Language |
| Week: | Second | | Time: | 11.00-12.30 (Slot 2) |
| Webpage: | http://ling.ucsd.edu/~barker
|
| Reader: | Download | | Room: | C1 |
Description Continuations provide important insights in the theory of computation
(Plotkin, Felleisen), logic (Griffin, Parigot), and, more recently,
natural language semantics. This course introduces continuations with
an emphasis on applying programming intuition to linguistic
applications.
For instance, a continuation-based approach derives Montague\'s
generalized quantifier treatment of noun phrases as a special case (de
Groote, Barker). For a second example, the continuation model of
left-to-right evaluation order in programming languages elegantly
characterizes weak crossover in English, as well as superiority
violations in wh-questions (Shan, Shan and Barker; comparisons with
Kempson et al. and Jaeger).
In general, continuations offer a principled, unified account of
linguistic phenomena in which some expression takes semantic effect
over a larger constituent (quantifier scope, indefinites, focus,
etc.), or in which evaluating some expression incurs a side effect on
later semantic processing (quantificational binding, anaphora,
presupposition projection, polarity licensing, etc.). Students will
explore concrete analyses using an efficient parser.
|
© 2003, 2004 LORIA, Carlos Areces. |
2003-11-20
| |
