From a7c26ba13dbf72718f66e8814f4cf74ec4647000 Mon Sep 17 00:00:00 2001 From: Jim Date: Sun, 1 Feb 2015 16:11:57 -0500 Subject: [PATCH 1/1] kill whitespace: was any of it significant markdown? --- content.mdwn | 2 +- installing.mdwn | 6 +++--- topics/week1.mdwn | 2 +- topics/week1_order.mdwn | 14 +++++++------- 4 files changed, 12 insertions(+), 12 deletions(-) diff --git a/content.mdwn b/content.mdwn index 8dbb20c2..d067df76 100644 --- a/content.mdwn +++ b/content.mdwn @@ -11,7 +11,7 @@ week in which they were introduced. ## Topics by week ## -Week 1: +Week 1: * [[Order in programming languages and natural language|topics/week1 order]] This discussion considers conjunction in a language that recognized presupposition failure. diff --git a/installing.mdwn b/installing.mdwn index dcd8d1fb..81f27ec1 100644 --- a/installing.mdwn +++ b/installing.mdwn @@ -21,8 +21,8 @@ wrong and exactly what you did to achieve joy. If you're using a Mac without MacPorts (explained below), then Chicken and OCaml will be installed under your user home; but Racket's and GHC's Installers put them into system directories. - - + + ## Identifying your system ## We'll assume you're using either Mac OS X, or Windows, or Linux. @@ -321,7 +321,7 @@ The current version of OCaml is 4.02.1 (released October 2014). location. 2. Open a terminal and type: - + sh /path/to/opam_installer.sh ~/bin Except replace `/path/to` with the real location, that you noted in step 1. When prompted "Do you want OPAM to modify ~/.bash_profile and ~/.ocamlinit?", say "y". diff --git a/topics/week1.mdwn b/topics/week1.mdwn index 4e1f0dda..5ab30bcb 100644 --- a/topics/week1.mdwn +++ b/topics/week1.mdwn @@ -81,7 +81,7 @@ I've started throwing in some **variables**. We'll say variables are any express x? xs -We'll follow a *convention* of using variables with short names and a final `s` to represent collections like sequences (to be discussed below). But this is just a convention to help us remember what we're up to, not a strict rule of the language. We'll also follow a convention of only using variables ending in `?` to represent functions that return a boolean value. Thus, for example, `zero?` will be a function that expects a single number argument and returns a boolean corresponding to whether that number is `0`. `odd?` will be a function that expects a single number argument and returns a boolean corresponding to whether than number is odd. Above, I suggested we might use `lessthan?` to represent a function that expects *two* number arguments, and again returns a boolean result. +We'll follow a *convention* of using variables with short names and a final `s` to represent collections like sequences (to be discussed below). But this is just a convention to help us remember what we're up to, not a strict rule of the language. We'll also follow a convention of only using variables ending in `?` to represent functions that return a boolean value. Thus, for example, `zero?` will be a function that expects a single number argument and returns a boolean corresponding to whether that number is `0`. `odd?` will be a function that expects a single number argument and returns a boolean corresponding to whether than number is odd. Above, I suggested we might use `lessthan?` to represent a function that expects *two* number arguments, and again returns a boolean result. We also conventionally reserve variables ending in `!` for a different special class of functions, that we will explain later in the course. diff --git a/topics/week1_order.mdwn b/topics/week1_order.mdwn index ad0db9a9..2a54503c 100644 --- a/topics/week1_order.mdwn +++ b/topics/week1_order.mdwn @@ -32,11 +32,11 @@ and the second program will print the number 2. A similar point is familiar from discussions in the lingusitics literature concerning discourse anaphora. - 1. a. A woman arrived. + 1. a. A woman arrived. b. She spoke. c. "a woman" == "she": OK - 2. a. She spoke. + 2. a. She spoke. b. A woman arrived. c. "a woman" == "she": nearly impossible @@ -45,7 +45,7 @@ event and a speaking event. It is easy to interpret the discourse as describing a situation in which the same woman who entered spoke. In contrast, in discourse (2), it is much more difficult---in fact, barring time travel, nearly impossible---to interpret the situation as -describing two events involving a single person. +describing two events involving a single person. The standard explanation is that the use of an indefinite such as "a woman" creates a new discourse referent, which a pronoun such as "she" @@ -67,7 +67,7 @@ going to take this analogy very seriously indeed: we will suggest that natural language meanings are isomorphic to computer programs. A closely related version of this claim is the Curry-Howard isomorphism, which establishes a parallel correspondence between logical -derivations and programs. +derivations and programs. One consequence of this correspondence is that it makes sense to think of interpreting an expression in natural language in the same terms as @@ -139,7 +139,7 @@ existence of a specific object that does not in fact exist, is that they are neither true nor false. Certainly (5) is not true, and saying that it is false appears to commit you to believing that its negation is true, which is not a commitment that everyone is willing -to make. +to make. Given that a partial-function approach to presupposition failure is coherent, let's consider one way to extend classical conjunction: @@ -182,7 +182,7 @@ prepared to commit to the falsity of the conjunction as soon as she realizes that the first conjunct is false. In fact, she can simply stop listening as soon as she hears "The sun is green and...". No matter whether the second conjunct is well defined, the conjunction as -a whole must be false. +a whole must be false. 7. The King of France is bald and the sun is green. @@ -199,7 +199,7 @@ the outcome depends on the order of the conjuncts. The truth table embodies the following processing strategy: if the status of the first conjunct reliably determines some aspect of the status of the conjunction as a whole, let the value of the left conjunct control the -outcome. +outcome. To be sure, it would also be coherent to choose a fully symmetric truth table by replacing line (h) with one that maps `F&#` to `#`, or -- 2.11.0