edits

[lambda.git] / topics / week15_continuation_applications.mdwn

diff --git a/topics/week15_continuation_applications.mdwn b/topics/week15_continuation_applications.mdwn
index 328b506..dc486d8 100644 (file)
--- a/topics/week15_continuation_applications.mdwn
+++ b/topics/week15_continuation_applications.mdwn
@@ -1,5 +1,5 @@
 <!-- λ ◊ ≠ ∃ Λ ∀ ≡ α β γ ρ ω φ ψ Ω ○ μ η δ ζ ξ ⋆ ★ • ∙ ● ⚫ 𝟎 𝟏 𝟐 𝟘 𝟙 𝟚 𝟬 𝟭 𝟮 ⇧ (U+2e17) ¢ -->
-[[!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.