From: Chris Date: Tue, 12 May 2015 13:19:56 +0000 (-0400) Subject: edits X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=c43652b69c6f35c070d267af73ed7c898ee99200 edits --- diff --git a/topics/_week15_continuation_applications.mdwn b/topics/_week15_continuation_applications.mdwn index cc5c9e29..b56fcc0f 100644 --- a/topics/_week15_continuation_applications.mdwn +++ b/topics/_week15_continuation_applications.mdwn @@ -109,7 +109,9 @@ Here, QDP is a scope-taking quantificational DP. Just to emphasize the similarity between QR and shift, we can use QR to provide insight into the tree task that mystified us earlier. +
```   .
@@ -126,7 +128,9 @@ a  __|___

First we QR the lower shift operator

+

.
@@ -147,7 +151,9 @@ S  ___|___

Next, we QR the upper shift operator

+

.
@@ -180,7 +186,9 @@ The relevant value for k is (\x.a(y(d(x e)))).  Then k "" is
a(y(d(""(e)))), and k(k "") is a(y(d((a(y(d(""(e)))))(e)))).  In tree
form:

+

.
@@ -211,7 +219,9 @@ S  ___|____
Repeating the process for the upper shift operator replaces each
occurrence of y with a copy of the whole tree.

+

.
```