From: Chris Date: Wed, 13 May 2015 17:32:53 +0000 (-0400) Subject: edits X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=425caebc804f10e37c739b7bdda256fede9a131c edits --- diff --git a/topics/week15_continuation_applications.mdwn b/topics/week15_continuation_applications.mdwn index 328b506e..dc486d8b 100644 --- a/topics/week15_continuation_applications.mdwn +++ b/topics/week15_continuation_applications.mdwn @@ -1,5 +1,5 @@ -[[!toc]] +[[!toc levels=2]] # Applications of continuations to natural language @@ -599,7 +599,20 @@ spontaneous resets, as long as the types match the following recipe: LOWER (---:---) == g[p]:α p S -This will be easiest to explain by presenting our first complete -example from natural language: - +At this point, it should be clear how the approach in the seminar +relates to the system developed in Barker and Shan 2014. Many +applications of continuations to natural langauge are developed in +detail there, including + +* Scope-taking +* Quantificational binding +* Weak crossover +* Generalized coordination +* Dynamic Binding +* WH-movement as delayed binding +* Semantic reconstruction effects +* Linear order effects in negative polarity licensing +* Donkey anaphora + +and much more.