Long-Distance Movement, Binding, and Scope in a Continuation Grammar

Total Page:16

File Type:pdf, Size:1020Kb

Long-Distance Movement, Binding, and Scope in a Continuation Grammar Long-distance movement, binding, and scope in a continuation grammar Cara Leong Su-Yi An Honours Thesis submitted in part fulfilment of the requirements for the degree of Bachelor of Arts with Honours in English Language Department of English Language and Literature Faculty of Arts and Social Sciences National University of Singapore Singapore 15 April 2019 This Honours Thesis represents my own work and due acknowledgement is given whenever information is derived from other sources. No part of this Honours Thesis has been or is being concurrently submitted for any other qualification at any other university. Cara Leong Su-Yi 15 April 2019 ii ACKNOWLEDGMENTS This thesis would not exist without my advisor, Dr Michael Yoshitaka Er- lewine. All the good ideas herein are mostly due to him; all the bad ones that remain were made less terrible by him. I am tremendously grateful for his discernment, enthusiasm, and fortitude in the face of nonsensical notation. This work has benefited from the insight of my linguist-friends. Thanksto Sharmala Solomon and Lauren Koh for accepting the presupposition that uni- corns exist, and for my knives. Anne Ng dug out years-old essays in service of this paper. Thanks also to Keely New for grammaticality judgments, proof- reading, and documenting the crucial moments after I poured an entire glass of chocolate milk onto my laptop three days before this thesis was due. I probably haven’t said this enough, but I owe almost everything to the friends who have seen me through university. Anne and Shien suffered through the worst of it — I’m ever so grateful. Truly, please. Ellen was there from day one. I miss Nicole and Kimi Raikkonen. Si En has never made a bad suggestion, and introduces me to new ways of thinking every time. Royston once told me my thesis was “interesting within the domain”, which I will take as a compliment any day. Ruizhi walked alongside on the writing journey mostly unironically. Leon planted 2020 dreams. Yuchuan bought me a kaya waffle a week. Darren housed my refrigerated goods and midnight worries. Thank you all for propping me up. Finally, all gratitude to my family — I feel impossibly privileged to be yours. Thanks for providing snacks and not asking how my thesis was going. Words aren’t enough. And to You, an open proposition if ever I knew one — still, always, thank You. iii CONTENTS Acknowledgments iii List of definitions, figures and tables vi Abbreviations vii Abstract viii 1 Introduction 1 2 A continuation grammar 3 2.1 Continuations 3 2.2 Semantic types and syntactic categories 3 2.3 Tower notation 6 2.4 Type-shifting in towers 9 2.4.1 lift 9 2.4.2 lower 13 2.5 Multi-layered towers and inverse scope 14 2.6 Gaps, movement and front 16 2.6.1 Gaps 16 2.6.2 front 17 2.7 The value of a continuation-based framework 19 3 Long-distance movement 20 3.1 The clause-bound scope of quantifiers 20 3.2 Limiting the scope of quantifiers 22 3.2.1 The Tensed Clause Condition 22 3.3 Long-distance movement fails 25 3.4 A solution 28 3.4.1 Adjacency and containment 28 3.4.2 An intermediate gap 29 3.5 Predictions 33 3.5.1 Embedding 34 3.5.2 Reconstructing the narrow scope reading 36 3.6 Summary 40 4 Binding and crossover 42 4.1 Binding variables in the continuation framework 42 4.1.1 Adding a new syntactic category 42 4.1.2 Binding and the Tensed Clause Condition 46 4.2 Short-distance movement 49 4.2.1 Movement without binding 49 4.2.2 Binding from a fronted expression 54 4.2.3 Summary 59 4.3 Long distance binding fails 60 iv 4.3.1 Incorrectly predicting crossover effects 61 4.3.2 Failing to predict crossover effects 64 4.4 Towards a solution 67 4.4.1 The Tensed Clause Condition does not apply 67 4.4.2 Altering the type-shifters 69 4.5 The root of the problem 71 5 Conclusion 73 References 74 v LIST OF DEFINITIONS 1 Tower notation 7 2 Combination schema in the continuation framework 8 3 lift type shifter 10 4 lower type-shifter 13 5 front type-shifter 17 6 Tensed Clause Condition (first version) 23 7 Tensed Clause Condition (second version) 29 8 Pronoun 42 9 bind type-shifter 44 10 prolift type-shifter 47 LIST OF FIGURES 1 Schemata of relationship between functors and arguments 6 2 Schema for composing towers (Barker and Shan 2014) 9 3 Schemata of relationship between functors and arguments 29 LIST OF TABLES 1 Syntactic categories necessary for composing with gapped clauses 60 vi ABBREVIATIONS B&S Barker and Shan 2014 DP determiner phrase QP quantifier phrase QR quantifier raising S sentence TCC Tensed Clause Condition vii ABSTRACT In this thesis, I describe and evaluate the continuation-based account of quan- tifier scope, variable binding and movement presented in Barker and Shan 2014. I show that under this account, it is possible to independently enforce the clause-boundedness of quantifier scope while accounting for movement, treat long-distance movement without variable binding, and deal with vari- able binding in local movement configurations. I also point out that the uniform treatment of scope, movement and binding through continuations makes fundamentally flawed predictions when faced with the combination of clause-bound quantifiers, long-distance movement, and variable binding. Par- ticularly, although the continuation framework claims to account for crossover effects, I show that such an account is lost in long-distance movement config- urations. I suggest that this problem has its roots in operations fundamental to the framework, and thus poses a serious challenge to the validity of the theory. viii CHAPTER 1 INTRODUCTION This thesis concerns itself with the treatment of quantifier scope, movement and variable binding in the semantic framework of Barker and Shan 2014. On this theory, the interplay between linear and scopal relationships is key; such an interaction harkens back to the seminal problem in semantics of quantifier scope ambiguity. May (1977) notes that a single form such as (1) can have two different readings: (1) Some man loves every woman. On one reading, a single man loves all women. On this “surface scope” reading, the exis- tential quantifier phrase (QP) some man is said to take wide scope over the universal QP every woman (∃ > ∀). On the second reading, in which the existential takes narrow scope (∀ > ∃), a potentially different man loves each woman. The availability of this “inverse scope” reading does not seem apparent based on surface word order. A common approach to of quantifier scope ambiguity posits the covert movement of quan- tifiers, or quantifier raising (QR), as an explanation for the availability of inverse scope readings. On this theory, objects are covertly moved to allow them to take scope, such that (1) is covertly analyzed as (2): (2) Logical Form (LF): every woman, some man loves. In contrast, so called “in-situ” theories of scope-taking allow for both surface and inverse scope readings to be obtained without appealing to covert movement. In particular, Partee (1987) introduced the notion of type-shifting to allow for in-situ analyses of inverse scope, while Hendriks (1993)’s Flexible Types analysis suggests multiple denotations for verbs and quantifiers. 1 Against this background, Barker and Shan (2014) — henceforth B&S — present a gram- mar that provides an in-situ analysis of quantifier scope ambiguity (see also Barker 2002; Barker and Shan 2008; Kiselyov and Shan 2014; Shan 2007; Shan and Barker 2006). The chief intuition in their framework, which I call the continuation framework, is that some expressions take their continuations, or the immediate context surrounding them, as ar- guments. Working under this hypothesis, B&S build a fragment that uses continuations to capture the scope-taking behavior of quantifiers. They then extend the use of continu- ations to in-situ analyses of movement and variable binding. In this thesis, I consider issues surrounding such a uniform treatment of scope, binding and movement in the continuation framework, and ultimately show that the continuation framework runs into serious problems when attempting to account for the combination of clause-bounded scope, long-distance movement, and variable binding. Chapter 2 intro- duces the continuation framework and shows how it uses type-shifting to provide an in- situ account of inverse scope and movement. In Chapter 3, I problematize unconstrained scope-taking behavior in the continuation framework and implement a constraint that I term the Tensed Clause Condition to account for the clause-boundedness of quantifiers. In Chapter 4, I turn to B&S’s account of variable binding and its interaction with move- ment. I point out a flaw in the way B&S characterize scopal and linear relationships, and suggest why this flaw may be fatal to the framework. Chapter 5 concludes. 2 CHAPTER 2 A CONTINUATION GRAMMAR In this chapter, I summarize the notational system and operations developed by B&S. I show how the continuation framework provides in-situ accounts of inverse scope and the extraction of expressions from their canonical positions. I then briefly discuss the value of working in the continuation framework. 2.1 Continuations A delimited continuation of an expression is “a portion of the context surrounding [that] expression” (Barker and Shan 2014:1) which represents “the computational future of an expression, i.e. what is about to happen to it” (Shan and Barker 2006:95). For example, the continuation of everyone in John gave everyone a pen is what remains of the clause after everyone is taken out of it: “John gave [ ] a pen”; the continuation of gave everyone a pen in the same sentence is “John [ ]”.
Recommended publications
  • Continuation-Passing Style
    Continuation-Passing Style CS 6520, Spring 2002 1 Continuations and Accumulators In our exploration of machines for ISWIM, we saw how to explicitly track the current continuation for a computation (Chapter 8 of the notes). Roughly, the continuation reflects the control stack in a real machine, including virtual machines such as the JVM. However, accurately reflecting the \memory" use of textual ISWIM requires an implementation different that from that of languages like Java. The ISWIM machine must extend the continuation when evaluating an argument sub-expression, instead of when calling a function. In particular, function calls in tail position require no extension of the continuation. One result is that we can write \loops" using λ and application, instead of a special for form. In considering the implications of tail calls, we saw that some non-loop expressions can be converted to loops. For example, the Scheme program (define (sum n) (if (zero? n) 0 (+ n (sum (sub1 n))))) (sum 1000) requires a control stack of depth 1000 to handle the build-up of additions surrounding the recursive call to sum, but (define (sum2 n r) (if (zero? n) r (sum2 (sub1 n) (+ r n)))) (sum2 1000 0) computes the same result with a control stack of depth 1, because the result of a recursive call to sum2 produces the final result for the enclosing call to sum2 . Is this magic, or is sum somehow special? The sum function is slightly special: sum2 can keep an accumulated total, instead of waiting for all numbers before starting to add them, because addition is commutative.
    [Show full text]
  • Denotational Semantics
    Denotational Semantics CS 6520, Spring 2006 1 Denotations So far in class, we have studied operational semantics in depth. In operational semantics, we define a language by describing the way that it behaves. In a sense, no attempt is made to attach a “meaning” to terms, outside the way that they are evaluated. For example, the symbol ’elephant doesn’t mean anything in particular within the language; it’s up to a programmer to mentally associate meaning to the symbol while defining a program useful for zookeeppers. Similarly, the definition of a sort function has no inherent meaning in the operational view outside of a particular program. Nevertheless, the programmer knows that sort manipulates lists in a useful way: it makes animals in a list easier for a zookeeper to find. In denotational semantics, we define a language by assigning a mathematical meaning to functions; i.e., we say that each expression denotes a particular mathematical object. We might say, for example, that a sort implementation denotes the mathematical sort function, which has certain properties independent of the programming language used to implement it. In other words, operational semantics defines evaluation by sourceExpression1 −→ sourceExpression2 whereas denotational semantics defines evaluation by means means sourceExpression1 → mathematicalEntity1 = mathematicalEntity2 ← sourceExpression2 One advantage of the denotational approach is that we can exploit existing theories by mapping source expressions to mathematical objects in the theory. The denotation of expressions in a language is typically defined using a structurally-recursive definition over expressions. By convention, if e is a source expression, then [[e]] means “the denotation of e”, or “the mathematical object represented by e”.
    [Show full text]
  • Degrees As Kinds Vs. Degrees As Numbers: Evidence from Equatives1 Linmin ZHANG — NYU Shanghai
    Degrees as kinds vs. degrees as numbers: Evidence from equatives1 Linmin ZHANG — NYU Shanghai Abstract. Within formal semantics, there are two views with regard to the ontological status of degrees: the ‘degree-as-number’ view (e.g., Seuren, 1973; Hellan, 1981; von Stechow, 1984) and the ‘degree-as-kind’ view (e.g., Anderson and Morzycki, 2015). Based on (i) empirical distinctions between comparatives and equatives and (ii) Stevens’s (1946) theory on the four levels of measurements, I argue that both views are motivated and needed in accounting for measurement- and comparison-related meanings in natural language. Specifically, I argue that since the semantics of comparatives potentially involves measurable differences, comparatives need to be analyzed based on scales with units, on which degrees are like (real) numbers. In contrast, since equatives are typically used to convey the non-existence of differences, equa- tives can be based on scales without units, on which degrees can be considered kinds. Keywords: (Gradable) adjectives, Comparatives, Equatives, Similatives, Levels of measure- ments, Measurements, Comparisons, Kinds, Degrees, Dimensions, Scales, Units, Differences. 1. Introduction The notion of degrees plays a fundamental conceptual role in understanding measurements and comparisons. Within the literature of formal semantics, there are two major competing views with regard to the ontological status of degrees. For simplicity, I refer to these two ontologies as the ‘degree-as-number’ view and the ‘degree-as-kind’ view in this paper. Under the more canonical ‘degree-as-number’ view, degrees are considered primitive objects (of type d). Degrees are points on abstract totally ordered scales (see Seuren, 1973; Hellan, 1981; von Stechow, 1984; Heim, 1985; Kennedy, 1999).
    [Show full text]
  • A Descriptive Study of California Continuation High Schools
    Issue Brief April 2008 Alternative Education Options: A Descriptive Study of California Continuation High Schools Jorge Ruiz de Velasco, Greg Austin, Don Dixon, Joseph Johnson, Milbrey McLaughlin, & Lynne Perez Continuation high schools and the students they serve are largely invisible to most Californians. Yet, state school authorities estimate This issue brief summarizes that over 115,000 California high school students will pass through one initial findings from a year- of the state’s 519 continuation high schools each year, either on their long descriptive study of way to a diploma, or to dropping out of school altogether (Austin & continuation high schools in 1 California. It is the first in a Dixon, 2008). Since 1965, state law has mandated that most school series of reports from the on- districts enrolling over 100 12th grade students make available a going California Alternative continuation program or school that provides an alternative route to Education Research Project the high school diploma for youth vulnerable to academic or conducted jointly by the John behavioral failure. The law provides for the creation of continuation W. Gardner Center at Stanford University, the schools ‚designed to meet the educational needs of each pupil, National Center for Urban including, but not limited to, independent study, regional occupation School Transformation at San programs, work study, career counseling, and job placement services.‛ Diego State University, and It contemplates more intensive services and accelerated credit accrual WestEd. strategies so that students whose achievement in comprehensive schools has lagged might have a renewed opportunity to ‚complete the This project was made required academic courses of instruction to graduate from high school.‛ 2 possible by a generous grant from the James Irvine Taken together, the size, scope and legislative design of the Foundation.
    [Show full text]
  • A Theory of Names and True Intensionality*
    A Theory of Names and True Intensionality? Reinhard Muskens Tilburg Center for Logic and Philosophy of Science [email protected] http://let.uvt.nl/general/people/rmuskens/ Abstract. Standard approaches to proper names, based on Kripke's views, hold that the semantic values of expressions are (set-theoretic) functions from possible worlds to extensions and that names are rigid designators, i.e. that their values are constant functions from worlds to entities. The difficulties with these approaches are well-known and in this paper we develop an alternative. Based on earlier work on a higher order logic that is truly intensional in the sense that it does not validate the axiom scheme of Extensionality, we develop a simple theory of names in which Kripke's intuitions concerning rigidity are accounted for, but the more unpalatable consequences of standard implementations of his theory are avoided. The logic uses Frege's distinction between sense and reference and while it accepts the rigidity of names it rejects the view that names have direct reference. Names have constant denotations across possible worlds, but the semantic value of a name is not determined by its denotation. Keywords: names, axiom of extensionality, true intensionality, rigid designation 1 Introduction Standard approaches to proper names, based on Kripke (1971, 1972), make the following three assumptions. (a) The semantic values of expressions are (possibly partial) functions from pos- sible worlds to extensions. (b) These functions are identified with their graphs, as in set theory. (c) Names are rigid designators, i.e. their extensions are world-independent. In particular, the semantic values of names are taken to be constant functions from worlds to entities, possibly undefined for some worlds.
    [Show full text]
  • EISS 12 Empirical Issues in Syntax and Semantics 12
    EISS 12 Empirical Issues in Syntax and Semantics 12 Edited by Christopher Pinon 2019 CSSP Paris http://www.cssp.cnrs.fr/eiss12/ ISSN 1769-7158 Contents Preface iv Anne Abeillé & Shrita Hassamal 1–30 Sluicing in Mauritian: A Fragment-Based Analysis Aixiu An & Anne Abeillé 31–60 Number Agreement in French Binomials Micky Daniels & Yael Greenberg 61–89 Extreme Adjectives in Comparative Structures and even Emilie Destruel & Joseph P. De Veaugh-Geiss 91–120 (Non-)Exhaustivity in French c’est-Clefts Regine Eckardt & Andrea Beltrama 121–155 Evidentials and Questions Yanwei Jin & Jean-Pierre Koenig 157–186 Expletive Negation in English, French, and Mandarin: A Semantic and Language Production Model Fabienne Martin & Zsófia Gyarmathy 187–216 A Finer-grained Typology of Perfective Operators Vítor Míguez 217–246 On (Un)certainty: The Semantic Evolution of Galician seguramente Emanuel Quadros 247–276 The Semantics of Possessive Noun Phrases and Temporal Modifiers EISS 12 iii Preface This is the twelfth volume of the series Empirical Issues in Syntax and Semantics (EISS), which, like the preceding eleven volumes of the series, is closely related to the conference series Colloque de Syntaxe et Sémantique à Paris (CSSP). The nine papers included in the present volume are based on presentations given at CSSP 2017, which took place on 23–25 November 2017 at École Normale Supérieure (http: //www.cssp.cnrs.fr/cssp2017/index_en.html). CSSP 2017 had a small thematic session entitled Discourse particles, but since the number of papers from the thematic session submitted to the volume was low, they are not grouped separately. I would like to take this opportunity to thank the reviewers, whose comments aided the authors in revising the first drafts of their pa- pers, sometimes substantially.
    [Show full text]
  • RELATIONAL PARAMETRICITY and CONTROL 1. Introduction the Λ
    Logical Methods in Computer Science Vol. 2 (3:3) 2006, pp. 1–22 Submitted Dec. 16, 2005 www.lmcs-online.org Published Jul. 27, 2006 RELATIONAL PARAMETRICITY AND CONTROL MASAHITO HASEGAWA Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606-8502 Japan, and PRESTO, Japan Science and Technology Agency e-mail address: [email protected] Abstract. We study the equational theory of Parigot’s second-order λµ-calculus in con- nection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order λ-calculus. It is observed that the relational parametricity on the tar- get calculus induces a natural notion of equivalence on the λµ-terms. On the other hand, the unconstrained relational parametricity on the λµ-calculus turns out to be inconsis- tent. Following these facts, we propose to formulate the relational parametricity on the λµ-calculus in a constrained way, which might be called “focal parametricity”. Dedicated to Prof. Gordon Plotkin on the occasion of his sixtieth birthday 1. Introduction The λµ-calculus, introduced by Parigot [26], has been one of the representative term calculi for classical natural deduction, and widely studied from various aspects. Although it still is an active research subject, it can be said that we have some reasonable un- derstanding of the first-order propositional λµ-calculus: we have good reduction theories, well-established CPS semantics and the corresponding operational semantics, and also some canonical equational theories enjoying semantic completeness [16, 24, 25, 36, 39]. The last point cannot be overlooked, as such complete axiomatizations provide deep understand- ing of equivalences between proofs and also of the semantic structure behind the syntactic presentation.
    [Show full text]
  • Continuation Calculus
    Eindhoven University of Technology MASTER Continuation calculus Geron, B. Award date: 2013 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain Continuation calculus Master’s thesis Bram Geron Supervised by Herman Geuvers Assessment committee: Herman Geuvers, Hans Zantema, Alexander Serebrenik Final version Contents 1 Introduction 3 1.1 Foreword . 3 1.2 The virtues of continuation calculus . 4 1.2.1 Modeling programs . 4 1.2.2 Ease of implementation . 5 1.2.3 Simplicity . 5 1.3 Acknowledgements . 6 2 The calculus 7 2.1 Introduction . 7 2.2 Definition of continuation calculus . 9 2.3 Categorization of terms . 10 2.4 Reasoning with CC terms .
    [Show full text]
  • 6.5 a Continuation Machine
    6.5. A CONTINUATION MACHINE 185 6.5 A Continuation Machine The natural semantics for Mini-ML presented in Chapter 2 is called a big-step semantics, since its only judgment relates an expression to its final value—a “big step”. There are a variety of properties of a programming language which are difficult or impossible to express as properties of a big-step semantics. One of the central ones is that “well-typed programs do not go wrong”. Type preservation, as proved in Section 2.6, does not capture this property, since it presumes that we are already given a complete evaluation of an expression e to a final value v and then relates the types of e and v. This means that despite the type preservation theorem, it is possible that an attempt to find a value of an expression e leads to an intermediate expression such as fst z which is ill-typed and to which no evaluation rule applies. Furthermore, a big-step semantics does not easily permit an analysis of non-terminating computations. An alternative style of language description is a small-step semantics.Themain judgment in a small-step operational semantics relates the state of an abstract machine (which includes the expression to be evaluated) to an immediate successor state. These small steps are chained together until a value is reached. This level of description is usually more complicated than a natural semantics, since the current state must embody enough information to determine the next and all remaining computation steps up to the final answer.
    [Show full text]
  • Compositional Semantics for Composable Continuations from Abortive to Delimited Control
    Compositional Semantics for Composable Continuations From Abortive to Delimited Control Paul Downen Zena M. Ariola University of Oregon fpdownen,[email protected] Abstract must fulfill. Of note, Sabry’s [28] theory of callcc makes use of Parigot’s λµ-calculus, a system for computational reasoning about continuation variables that have special properties and can only be classical proofs, serves as a foundation for control operations em- instantiated by callcc. As we will see, this not only greatly aids in bodied by operators like Scheme’s callcc. We demonstrate that the reasoning about terms with free variables, but also helps in relating call-by-value theory of the λµ-calculus contains a latent theory of the equational and operational interpretations of callcc. delimited control, and that a known variant of λµ which unshack- In another line of work, Parigot’s [25] λµ-calculus gives a sys- les the syntax yields a calculus of composable continuations from tem for computing with classical proofs. As opposed to the pre- the existing constructs and rules for classical control. To relate to vious theories based on the λ-calculus with additional primitive the various formulations of control effects, and to continuation- constants, the λµ-calculus begins with continuation variables in- passing style, we use a form of compositional program transforma- tegrated into its core, so that control abstractions and applications tions which preserves the underlying structure of equational the- have the same status as ordinary function abstraction. In this sense, ories, contexts, and substitution. Finally, we generalize the call- the λµ-calculus presents a native language of control.
    [Show full text]
  • Donkey Anaphora Is In-Scope Binding∗
    Semantics & Pragmatics Volume 1, Article 1: 1–46, 2008 doi: 10.3765/sp.1.1 Donkey anaphora is in-scope binding∗ Chris Barker Chung-chieh Shan New York University Rutgers University Received 2008-01-06 = First Decision 2008-02-29 = Revised 2008-03-23 = Second Decision 2008-03-25 = Revised 2008-03-27 = Accepted 2008-03-27 = Published 2008- 06-09 Abstract We propose that the antecedent of a donkey pronoun takes scope over and binds the donkey pronoun, just like any other quantificational antecedent would bind a pronoun. We flesh out this idea in a grammar that compositionally derives the truth conditions of donkey sentences containing conditionals and relative clauses, including those involving modals and proportional quantifiers. For example, an indefinite in the antecedent of a conditional can bind a donkey pronoun in the consequent by taking scope over the entire conditional. Our grammar manages continuations using three independently motivated type-shifters, Lift, Lower, and Bind. Empirical support comes from donkey weak crossover (*He beats it if a farmer owns a donkey): in our system, a quantificational binder need not c-command a pronoun that it binds, but must be evaluated before it, so that donkey weak crossover is just a special case of weak crossover. We compare our approach to situation-based E-type pronoun analyses, as well as to dynamic accounts such as Dynamic Predicate Logic. A new ‘tower’ notation makes derivations considerably easier to follow and manipulate than some previous grammars based on continuations. Keywords: donkey anaphora, continuations, E-type pronoun, type-shifting, scope, quantification, binding, dynamic semantics, weak crossover, donkey pronoun, variable-free, direct compositionality, D-type pronoun, conditionals, situation se- mantics, c-command, dynamic predicate logic, donkey weak crossover ∗ Thanks to substantial input from Anna Chernilovskaya, Brady Clark, Paul Elbourne, Makoto Kanazawa, Chris Kennedy, Thomas Leu, Floris Roelofsen, Daniel Rothschild, Anna Szabolcsi, Eytan Zweig, and three anonymous referees.
    [Show full text]
  • Nominal Anchoring
    Nominal anchoring Specificity, definiteness and article systems across languages Edited by Kata Balogh Anja Latrouite Robert D. Van Valin‚ Jr. language Topics at the Grammar­Discourse science press Interface 5 Topics at the Grammar­Discourse Interface Editors: Philippa Cook (University of Göttingen), Anke Holler (University of Göttingen), Cathrine Fabricius­Hansen (University of Oslo) In this series: 1. Song, Sanghoun. Modeling information structure in a cross­linguistic perspective. 2. Müller, Sonja. Distribution und Interpretation von Modalpartikel­Kombinationen. 3. Bueno Holle, Juan José. Information structure in Isthmus Zapotec narrative and conversation. 4. Parikh, Prashant. Communication and content. 5. Balogh, Kata, Anja Latrouite & Robert D. Van Valin‚ Jr. (eds.) Nominal anchoring: Specificity, definiteness and article systems across languages. ISSN: 2567­3335 Nominal anchoring Specificity, definiteness and article systems across languages Edited by Kata Balogh Anja Latrouite Robert D. Van Valin‚ Jr. language science press Balogh, Kata, Anja Latrouite & Robert D. Van Valin‚ Jr. (eds.). 2020. Nominal anchoring: Specificity, definiteness and article systems across languages (Topics at the Grammar-Discourse Interface 5). Berlin: Language Science Press. This title can be downloaded at: http://langsci-press.org/catalog/book/283 © 2020, the authors Published under the Creative Commons Attribution 4.0 Licence (CC BY 4.0): http://creativecommons.org/licenses/by/4.0/ ISBN: 978-3-96110-284-6 (Digital) 978-3-96110-285-3 (Hardcover) ISSN:
    [Show full text]