Semantics-4Th-Ed.Pdf
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Ditransitive Verbs in Language Use
Chapter 3 Aspects of description: ditransitive verbs in language use This chapter provides a corpus-based description of individual ditransitive verbs in actual language use. First, the two verbs that are typical of ditransitivity in ICE-GB will be analysed: give and tell (see section 3.1). Second, the four habitual ditransitive verbs in ICE-GB (i.e. ask, show, send and offer) will be scrutinised (see section 3.2). Particular emphasis in all the analyses will be placed on the different kinds of routines that are involved in the use of ditransitive verbs. The description of peripheral ditransitive verbs, on the other hand, will centre on the concepts of grammatical institutionalisation and conventionalisation (see section 3.3). At the end of this chapter, the two aspects will be discussed in a wider setting in the assessment of the role of linguistic routine and creativity in the use of ditransitive verbs (see section 3.4). 3.1 Typical ditransitive verbs in ICE-GB In the present study, typical ditransitive verbs are verbs which are frequently attested in ICE-GB in general (i.e. > 700 occurrences) and which are associated with an explicit ditransitive syntax in some 50% of all occurrences or more (cf. Figure 2.4, p. 84). These standards are met by give (see section 3.1.1) and tell (see section 3.1.2). 3.1.1 GIVE In light of recent psycholinguistic and cognitive-linguistic evidence, it is not sur- prising that the most frequent ditransitive verb in ICE-GB is GIVE.1 Experiment- al data have led Ninio (1999), for example, to put forward the hypothesis that children initially acquire constructions through one (or very few) ‘pathbreaking verbs(s)’. -
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”. -
Mathematics and Computation
Mathematics and Computation Mathematics and Computation Ideas Revolutionizing Technology and Science Avi Wigderson Princeton University Press Princeton and Oxford Copyright c 2019 by Avi Wigderson Requests for permission to reproduce material from this work should be sent to [email protected] Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu All Rights Reserved Library of Congress Control Number: 2018965993 ISBN: 978-0-691-18913-0 British Library Cataloging-in-Publication Data is available Editorial: Vickie Kearn, Lauren Bucca, and Susannah Shoemaker Production Editorial: Nathan Carr Jacket/Cover Credit: THIS INFORMATION NEEDS TO BE ADDED WHEN IT IS AVAILABLE. WE DO NOT HAVE THIS INFORMATION NOW. Production: Jacquie Poirier Publicity: Alyssa Sanford and Kathryn Stevens Copyeditor: Cyd Westmoreland This book has been composed in LATEX The publisher would like to acknowledge the author of this volume for providing the camera-ready copy from which this book was printed. Printed on acid-free paper 1 Printed in the United States of America 10 9 8 7 6 5 4 3 2 1 Dedicated to the memory of my father, Pinchas Wigderson (1921{1988), who loved people, loved puzzles, and inspired me. Ashgabat, Turkmenistan, 1943 Contents Acknowledgments 1 1 Introduction 3 1.1 On the interactions of math and computation..........................3 1.2 Computational complexity theory.................................6 1.3 The nature, purpose, and style of this book............................7 1.4 Who is this book for?........................................7 1.5 Organization of the book......................................8 1.6 Notation and conventions..................................... -
Flexible Valency in Chintang.∗
Flexible valency in Chintang.∗ Robert Schikowskia , Netra Paudyalb , and Balthasar Bickela a University of Zürich b University of Leipzig 1 e Chintang language Chintang [ˈts̻ ʰiɳʈaŋ]̻ (ISO639.3: ctn) is a Sino-Tibetan language of Nepal. It is named aer the village where it is mainly spoken. e village lies in the hills of Eastern Nepal, bigger cities within day’s reach being Dhankuṭā and Dharān. ere are no official data on the number of speakers, but we estimate there to be around 4,000 - 5,000 speakers. Most speakers are bi- or trilingual, with Nepali (the Indo-Aryan lingua franca of Nepal) as one and Bantawa (a related Sino-Tibetan language) as the other additional language. Monolingual speakers are still to be found mainly among elderly women, whereas a considerable portion of the younger generation is rapidly shiing to Nepali. Genealogically, Chintang belongs to the Kiranti group. e Kiranti languages are generally accepted to belong to the large Sino-Tibetan (or Tibeto-Burman) family, although their position within this family is controversial (cf. e.g. urgood 2003, Ebert 2003). Based on phonological evidence, Chintang belongs to the Eastern subgroup of Kiranti (Bickel et al. 2010). ere are two major dialects (Mulgaũ and Sambugaũ ) named aer the areas where they are spoken. e differences between them concern morphology and the lexicon but, as far as we know, not syntax, and so we will not distinguish between dialects in this chapter. For all examples the source has been marked behind the translation. Wherever possible, we take data from the Chintang Language Corpus (Bickel et al. -
Operational Semantics with Hierarchical Abstract Syntax Graphs*
Operational Semantics with Hierarchical Abstract Syntax Graphs* Dan R. Ghica Huawei Research, Edinburgh University of Birmingham, UK This is a motivating tutorial introduction to a semantic analysis of programming languages using a graphical language as the representation of terms, and graph rewriting as a representation of reduc- tion rules. We show how the graphical language automatically incorporates desirable features, such as a-equivalence and how it can describe pure computation, imperative store, and control features in a uniform framework. The graph semantics combines some of the best features of structural oper- ational semantics and abstract machines, while offering powerful new methods for reasoning about contextual equivalence. All technical details are available in an extended technical report by Muroya and the author [11] and in Muroya’s doctoral dissertation [21]. 1 Hierarchical abstract syntax graphs Before proceeding with the business of analysing and transforming the source code of a program, a com- piler first parses the input text into a sequence of atoms, the lexemes, and then assembles them into a tree, the Abstract Syntax Tree (AST), which corresponds to its grammatical structure. The reason for preferring the AST to raw text or a sequence of lexemes is quite obvious. The structure of the AST incor- porates most of the information needed for the following stage of compilation, in particular identifying operations as nodes in the tree and operands as their branches. This makes the AST algorithmically well suited for its purpose. Conversely, the AST excludes irrelevant lexemes, such as separators (white-space, commas, semicolons) and aggregators (brackets, braces), by making them implicit in the tree-like struc- ture. -
Formal Semantics
HG2002 Semantics and Pragmatics Formal Semantics Francis Bond Division of Linguistics and Multilingual Studies http://www3.ntu.edu.sg/home/fcbond/ [email protected] Lecture 10 Location: HSS Auditorium Creative Commons Attribution License: you are free to share and adapt as long as you give appropriate credit and add no additional restrictions: https://creativecommons.org/licenses/by/4.0/. HG2002 (2018) Overview ã Revision: Components ã Quantifiers and Higher Order Logic ã Modality ã (Dynamic Approaches to Discourse) ã Next Lecture: Chapter 11 — Cognitive Semantics HG2002 (2018) 1 Revision: Componential Analysis HG2002 (2018) 2 Break word meaning into its components ã components allow a compact description ã interact with morphology/syntax ã form part of our cognitive architecture ã For example: woman [female] [adult] [human] spinster [female] [adult] [human] [unmarried] bachelor [male] [adult] [human] [unmarried] wife [female] [adult] [human] [married] ã We can make things more economical (fewer components): woman [+female] [+adult] [+human] spinster [+female] [+adult] [+human] [–married] bachelor [–female] [+adult] [+human] [–married] wife [+female] [+adult] [+human] [+married] HG2002 (2018) 3 Defining Relations using Components ã hyponymy: P is a hyponym of Q if all the components of Q are also in P. spinster ⊂ woman; wife ⊂ woman ã incompatibility: P is incompatible with Q if they share some components but differ in one or more contrasting components spinster ̸≈ wife ã Redundancy Rules [+human] ! [+animate] [+animate] ! [+concrete] [+married] -
A Denotational Semantics Approach to Functional and Logic Programming
A Denotational Semantics Approach to Functional and Logic Programming TR89-030 August, 1989 Frank S.K. Silbermann The University of North Carolina at Chapel Hill Department of Computer Science CB#3175, Sitterson Hall Chapel Hill, NC 27599-3175 UNC is an Equal OpportunityjAfflrmative Action Institution. A Denotational Semantics Approach to Functional and Logic Programming by FrankS. K. Silbermann A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in par tial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science. Chapel Hill 1989 @1989 Frank S. K. Silbermann ALL RIGHTS RESERVED 11 FRANK STEVEN KENT SILBERMANN. A Denotational Semantics Approach to Functional and Logic Programming (Under the direction of Bharat Jayaraman.) ABSTRACT This dissertation addresses the problem of incorporating into lazy higher-order functional programming the relational programming capability of Horn logic. The language design is based on set abstraction, a feature whose denotational semantics has until now not been rigorously defined. A novel approach is taken in constructing an operational semantics directly from the denotational description. The main results of this dissertation are: (i) Relative set abstraction can combine lazy higher-order functional program ming with not only first-order Horn logic, but also with a useful subset of higher order Horn logic. Sets, as well as functions, can be treated as first-class objects. (ii) Angelic powerdomains provide the semantic foundation for relative set ab straction. (iii) The computation rule appropriate for this language is a modified parallel outermost, rather than the more familiar left-most rule. (iv) Optimizations incorporating ideas from narrowing and resolution greatly improve the efficiency of the interpreter, while maintaining correctness. -
Denotational Semantics
Denotational Semantics 8–12 lectures for Part II CST 2010/11 Marcelo Fiore Course web page: http://www.cl.cam.ac.uk/teaching/1011/DenotSem/ 1 Lecture 1 Introduction 2 What is this course about? • General area. Formal methods: Mathematical techniques for the specification, development, and verification of software and hardware systems. • Specific area. Formal semantics: Mathematical theories for ascribing meanings to computer languages. 3 Why do we care? • Rigour. specification of programming languages . justification of program transformations • Insight. generalisations of notions computability . higher-order functions ... data structures 4 • Feedback into language design. continuations . monads • Reasoning principles. Scott induction . Logical relations . Co-induction 5 Styles of formal semantics Operational. Meanings for program phrases defined in terms of the steps of computation they can take during program execution. Axiomatic. Meanings for program phrases defined indirectly via the ax- ioms and rules of some logic of program properties. Denotational. Concerned with giving mathematical models of programming languages. Meanings for program phrases defined abstractly as elements of some suitable mathematical structure. 6 Basic idea of denotational semantics [[−]] Syntax −→ Semantics Recursive program → Partial recursive function Boolean circuit → Boolean function P → [[P ]] Concerns: • Abstract models (i.e. implementation/machine independent). Lectures 2, 3 and 4. • Compositionality. Lectures 5 and 6. • Relationship to computation (e.g. operational semantics). Lectures 7 and 8. 7 Characteristic features of a denotational semantics • Each phrase (= part of a program), P , is given a denotation, [[P ]] — a mathematical object representing the contribution of P to the meaning of any complete program in which it occurs. • The denotation of a phrase is determined just by the denotations of its subphrases (one says that the semantics is compositional). -
The Representation of Third Person and Its Consequences for Person-Case Effects
The Representation of Third Person and Its Consequences for Person-Case Effects The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Nevins, Andrew. The representation of third person and its consequences for person-case effects. Natural Language and Linguistic Theory 25 (2007): 273-313. Published Version http://dx.doi.org/10.1007/s11049-006-9017-2 Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:2223518 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#OAP Nat Lang Linguist Theory (2007) 25:273–313 DOI 10.1007/s11049-006-9017-2 ORIGINAL PAPER The representation of third person and its consequences for person-case effects Andrew Nevins Received: 13 June 2005 / Accepted: 3 July 2006 / Published online: 28 April 2007 © Springer Science+Business Media B.V. 2007 Abstract In modeling the effects of the Person-Case Constraint (PCC), a common claim is that 3rd person “is not a person”. However, while this claim does work in the syntax, it creates problems in the morphology. For example, characterizing the well-known “spurious se effect” in Spanish simply cannot be done without reference to 3rd person. Inspired by alternatives to underspecification that have emerged in phonology (e.g., Calabrese, 1995), a revised featural system is proposed, whereby syntactic agreement may be relativized to certain values of a feature, in particular, the contrastive and marked values. -
The Diachronic Development of Differential Object Marking in Spanish Ditransitive Constructions Klaus Von Heusinger Universität Zu Köln
Chapter 11 The diachronic development of Differential Object Marking in Spanish ditransitive constructions Klaus von Heusinger Universität zu Köln Differential Object Marking (DOM) in Spanish synchronically depends on the referential features of the direct object, such as animacy and referentiality, and on the semantics of the verb. Recent corpus studies suggest that the diachronic development proceeds along the same features, which are ranked in scales, namely the Animacy Scale, the Referentiality Scale and the Affectedness Scale. The present paper investigates this development in ditran- sitive constructions from the 17th to the 20th century. Ditransitive constructions in Spanish are of particular interest since the literature assumes that the differential object marker a is often blocked by the co-occurrence of the case marker a for the indirect object. The paper focuses on the conditions that enhance or weaken this blocking effect. It investigates three types of constructions with a ditransitive verb: (i) constructions with indirect objects real- ized as a-marked full noun phrases, (ii) constructions with indirect objects as clitic pronouns, and (iii) constructions with non-overt indirect objects. The results clearly show that DOM is more frequent with (iii) and less frequent with (i). Thus the results support the observation that the co-occurrence of an a-marked indirect object (partly) blocks a-marking of the di- rect object to a certain extent. Furthermore, the results show for the first time that indirect objects realized as clitic pronouns without the marker a have a weaker blocking effect, but still a stronger one than constructions without overt indirect objects. In summary, the paper presents new and original evidence of the competition between arguments in a diachronic perspective. -
Mechanized Semantics of Simple Imperative Programming Constructs*
App eared as technical rep ort UIB Universitat Ulm Fakultat fur Informatik Dec Mechanized Semantics of Simple Imp erative Programming Constructs H Pfeifer A Dold F W von Henke H Rue Abt Kunstliche Intelligenz Fakultat fur Informatik Universitat Ulm D Ulm verifixkiinformatikuniulmde Abstract In this pap er a uniform formalization in PVS of various kinds of semantics of imp er ative programming language constructs is presented Based on a comprehensivede velopment of xed p oint theory the denotational semantics of elementary constructs of imp erative programming languages are dened as state transformers These state transformers induce corresp onding predicate transformers providing a means to for mally derivebothaweakest lib eral precondition semantics and an axiomatic semantics in the style of Hoare Moreover algebraic laws as used in renement calculus pro ofs are validated at the level of predicate transformers Simple reformulations of the state transformer semantics yield b oth a continuationstyle semantics and rules similar to those used in Structural Op erational Semantics This formalization provides the foundations on which formal sp ecication of program ming languages and mechanical verication of compilation steps are carried out within the Verix pro ject This research has b een funded in part by the Deutsche Forschungsgemeinschaft DFG under pro ject Verix Contents Intro duction Related Work Overview A brief description of PVS Mechanizing Domain -
Ditransitive Constructions Max Planck Institute for Evolutionary Anthropology, Leipzig (Germany) 23-25 November 2007
Conference on Ditransitive Constructions Max Planck Institute for Evolutionary Anthropology, Leipzig (Germany) 23-25 November 2007 Abstracts On “Dimonotransitive” Structures in English Carmen Aguilera Carnerero University of Granada Ditransitive structures have been prototypically defined as those combinations of a ditransitive verb with an indirect object and a direct object. However, although in the prototypical ditransitive construction in English, both objects are present, there is often omission of one of the constituentes, usually the indirect object. The absence of the indirect object has been justified on the basis of the irrelevance of its specification or the possibility of recovering it from the context. The absence of the direct object, on the other hand, is not so common and only occur with a restricted number of verbs (e.g. pay, show or tell).This type of sentences have been called “dimonotransitives” by Nelson, Wallis and Aarts (2002) and the sole presence in the syntactic structure arises some interesting questions we want to clarify in this article, such as: (a) the degree of syntactic and semantic obligatoriness of indirect objects and certain ditransitive verbs (b) the syntactic behaviour of indirect objects in absence of the direct object, in other words, does the Oi take over some of the properties of typical direct objects as Huddleston and Pullum suggest? (c) The semantic and pragmatic interpretations of the missing element. To carry out our analysis, we will adopt a corpus –based approach and especifically we will use the International Corpus of English (ICE) for the most frequent ditransitive verbs (Mukherjee 2005) and the British National Corpus (BNC) for the not so frequent verbs.