DOCSLIB.ORG

Denotational Semantics ______

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Denotational Semantics ______ Denotational Semantics ____________________________________________________________________________ ____________________________________________________________________________ ____________________________________________________________________________ A METHODOLOGY FOR LANGUAGE DEVELOPMENT ____________________________________________________________________________ ____________________________________________________________________________ David A. Schmidt Copyright notice: Copyright 1997 by David A. Schmidt. Permission to reproduce this material must be obtained from the author. Author’s address: David Schmidt, Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, KS 66506. [email protected] Contents Preface viii Chapter 0 INTRODUCTION _______________________________________________________________________________________________ 1 Methods for Semantics Specification 2 Suggested Readings 3 Chapter 1 SYNTAX ______________________________________________________________________________________________________________ 5 1.1 Abstract Syntax Definitions 9 1.2 Mathematical and Structural Induction 12 Suggested Readings 15 Exercises 15 Chapter 2 SETS, FUNCTIONS, AND DOMAINS ______________________________________________________________ 17 2.1 Sets 17 2.1.1 Constructions on Sets 18 2.2 Functions 20 2.2.1 Representing Functions as Sets 21 2.2.2 Representing Functions as Equations 24 2.3 Semantic Domains 25 2.3.1 Semantic Algebras 25 Suggested Readings 27 Exercises 27 Chapter 3 DOMAIN THEORY I: SEMANTIC ALGEBRAS ____________________________________________ 30 3.1 Primitive Domains 30 3.2 Compound Domains 34 3.2.1 Product 34 3.2.2 Disjoint Union 35 3.2.3 Function Space 39 3.2.4 Lifted Domains and Strictness 42 iii iv Contents 3.3 Recursive Function Definitions 44 3.4 Recursive Domain Definitions 46 3.5 Summary 46 Suggested Readings 48 Exercises 48 Chapter 4 BASIC STRUCTURE OF DENOTATIONAL DEFINITIONS _______________________ 54 4.1 The Valuation Function 54 4.2 Format of a Denotational Definition 57 4.3 A Calculator Language 59 Suggested Readings 63 Exercises 63 Chapter 5 IMPERATIVE LANGUAGES ___________________________________________________________________________ 66 5.1 A Language with Assignment 66 5.1.1 Programs are Functions 72 5.2 An Interactive File Editor 73 5.2.1 Interactive Input and Partial Syntax 78 5.3 A Dynamically Typed Language with Input and Output 80 5.4 Altering the Properties of Stores 82 5.4.1 Delayed Evaluation 82 5.4.2 Retaining Multiple Stores 86 5.4.3 Noncommunicating Commands 87 Suggested Readings 88 Exercises 88 Chapter 6 DOMAIN THEORY II: RECURSIVELY DEFINED FUNCTIONS _______________ 94 6.1 Some Recursively Defined Functions 95 6.2 Partial Orderings 98 6.3 Continuous Functions 102 6.4 Least Fixed Points 103 6.5 Domains are Cpos 104 6.6 Examples 109 6.6.1 Factorial Function 109 6.6.2 Copyout Function 110 6.6.3 Double Recursion 111 6.6.4 Simultaneous Definitions 111 v 6.6.5 The While-Loop 112 6.6.6 Soundness of Hoare’s Logic 115 6.7 Reasoning about Least Fixed Points 117 Suggested Readings 119 Exercises 120 Chapter 7 LANGUAGES WITH CONTEXTS ___________________________________________________________________ 125 7.1 A Block-Structured Language 127 7.1.1 Stack-Managed Storage 134 7.1.2 The Meanings of Identifiers 136 7.2 An Applicative Language 137 7.2.1 Scoping Rules 140 7.2.2 Self-Application 143 7.2.3 Recursive Declarations 145 7.3 Compound Data Structures 148 Suggested Readings 154 Exercises 154 Chapter 8 ABSTRACTION, CORRESPONDENCE, AND QUALIFICATION ______________ 160 8.1 Abstraction 161 8.1.1 Recursive Bindings 164 8.2 Parameterization 165 8.2.1 Polymorphism and Typing 167 8.3 Correspondence 170 8.4 Qualification 171 8.5 Orthogonality 173 Suggested Readings 174 Exercises 174 Chapter 9 CONTROL AS A SEMANTIC DOMAIN _________________________________________________________ 178 9.1 Continuations 178 9.1.1 Other Levels of Continuations 181 9.2 Exception Mechanisms 182 9.3 Backtracking Mechanisms 183 9.4 Coroutine Mechanisms 183 9.5 Unrestricted Branching Mechanisms 187 vi Contents 9.6 The Relationship between Direct and Continuation Semantics 193 Suggested Readings 195 Exercises 195 Chapter 10 IMPLEMENTATION OF DENOTATIONAL DEFINITIONS _______________________ 199 10.1 A General Method of Implementation 199 10.1.1 The SIS and SPS Systems 200 10.2 Static Semantics Processing 201 10.3 The Structure of the Evaluator 203 10.3.1 A Stack-Based Evaluator 204 10.3.2 PSP and Appel’s System 208 10.4 Combinator-Based Semantic Notations 209 10.4.1 The Plumb and CERES Systems 211 10.5 Transformations on the Semantic Definition 212 10.5.1 First-Order Data Objects 212 10.5.2 Global Variables 214 10.5.3 Control Structures 217 10.6 Implementation of Continuation-Based Definitions 218 10.6.1 The CGP and VDM Methods 222 10.7 Correctness of Implementation and Full Abstraction 223 Suggested Readings 225 Exercises 226 Chapter 11 DOMAIN THEORY III: RECURSIVE DOMAIN SPECIFICATIONS __________ 230 11.1 Reflexive Domains Have Infinite Elements 230 11.2 The Inverse Limit Construction 234 11.3 Applications 241 11.3.1 Linear Lists 242 11.3.2 Self-Applicative Procedures 243 11.3.3 Recursive Record Structures 244 Suggested Readings 245 Exercises 245 Chapter 12 NONDETERMINISM AND CONCURRENCY ________________________________________________ 250 12.1 Powerdomains 251 12.2 The Guarded Command Language 251 vii 12.3 Concurrency and Resumption Semantics 254 12.4 An Alternative Semantics for Concurrency 258 12.5 The Powerdomain Structure 265 12.5.1 Discrete Powerdomains 266 12.5.2 General Powerdomains 268 Suggested Readings 274 Exercises 274 Bibliography 217 Preface Denotational semantics is a methodology for giving mathematical meaning to programming languages and systems. It was developed by Christopher Strachey’s Programming Research Group at Oxford University in the 1960s. The method combines mathematical rigor, due to the work of Dana Scott, with notational elegance, due to Strachey. Originally used as an analysis tool, denotational semantics has grown in use as a tool for language design and implementa- tion. This book was written to make denotational semantics accessible to a wider audience and to update existing texts in the area. I have presented the topic from an engineering viewpoint, emphasizing the descriptional and implementational aspects. The relevant mathematics is also included, for it gives rigor and validity to the method and provides a foundation for further research. The book is intended as a tutorial for computing professionals and as a text for university courses at the upper undergraduate or beginning graduate level. The reader should be acquainted with discrete structures and one or more general purpose programming languages. Experience with an applicative-style language such as LISP, ML, or Scheme is also helpful. CONTENTS OF THE BOOK ________________________________________________________________________________________________ The Introduction and Chapters 1 through 7 form the core of the book. The Introduction pro- vides motivation and a brief survey of semantics specification methods. Chapter 1 introduces BNF, abstract syntax, and structural induction. Chapter 2 lists those concepts of set theory that are relevant to semantic domain theory. Chapter 3 covers semantic domains, the value sets used in denotational semantics. The fundamental domains and their related operations are presented. Chapter 4 introduces basic denotational semantics. Chapter 5 covers the semantics of computer storage and assignment as found in conventional imperative languages. Nontradi- tional methods of store evaluation are also considered. Chapter 6 presents least fixed point semantics, which is used for determining the meaning of iterative and recursive definitions. The related semantic domain theory is expanded to include complete partial orderings; ‘‘predomains’’ (complete partial orderings less ‘‘bottom’’ elements) are used. Chapter 7 cov- ers block structure and data structures. Chapters 8 through 12 present advanced topics. Tennent’s analysis of procedural abstrac- tion and general binding mechanisms is used as a focal point for Chapter 8. Chapter 9 analyzes forms of imperative control and branching. Chapter 10 surveys techniques for converting a denotational definition into a computer implementation. Chapter 11 contains an overview of Scott’s inverse limit construction for building recursively defined domains. Chapter 12 closes the book with an introduction to methods for understanding nondeterminism and concurrency. Throughout the book I have consistently abused the noun ‘‘access,’’ treating it as a verb. Also, ‘‘iff’’ abbreviates the phrase ‘‘if and only if.’’ viii Preface ix ORGANIZATION OF A COURSE ________________________________________________________________________________________ The book contains more material than what can be comfortably covered in one term. A course plan should include the core chapters; any remaining time can be used for Chapters 8 through 12, which are independent of one another and can be read in any order. The core can be han- dled as follows: • Present the Introduction first. You may wish to give a one lecture preview of Chapter 4. A preview motivates the students to carefully study the material in the background Chapters 1 through 3. • Cover all of Chapters 1 and 2, as they are short and introduce crucial concepts. • Use Chapter 3 as a ‘‘reference manual.’’ You may wish to start at the summary Section 3.5 and outline the structures of semantic domains. Next,
Load more

Recommended publications
  • Two-Dimensionalism: Semantics and Metasemantics
    Two-Dimensionalism: Semantics and Metasemantics YEUNG, \y,ang -C-hun ...:' . '",~ ... ~ .. A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Master of Philosophy In Philosophy The Chinese University of Hong Kong January 2010 Abstract of thesis entitled: Two-Dimensionalism: Semantics and Metasemantics Submitted by YEUNG, Wang Chun for the degree of Master of Philosophy at the Chinese University of Hong Kong in July 2009 This ,thesis investigates problems surrounding the lively debate about how Kripke's examples of necessary a posteriori truths and contingent a priori truths should be explained. Two-dimensionalism is a recent development that offers a non-reductive analysis of such truths. The semantic interpretation of two-dimensionalism, proposed by Jackson and Chalmers, has certain 'descriptive' elements, which can be articulated in terms of the following three claims: (a) names and natural kind terms are reference-fixed by some associated properties, (b) these properties are known a priori by every competent speaker, and (c) these properties reflect the cognitive significance of sentences containing such terms. In this thesis, I argue against two arguments directed at such 'descriptive' elements, namely, The Argument from Ignorance and Error ('AlE'), and The Argument from Variability ('AV'). I thereby suggest that reference-fixing properties belong to the semantics of names and natural kind terms, and not to their metasemantics. Chapter 1 is a survey of some central notions related to the debate between descriptivism and direct reference theory, e.g. sense, reference, and rigidity. Chapter 2 outlines the two-dimensional approach and introduces the va~ieties of interpretations 11 of the two-dimensional framework.
    [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]
  • Denotation and Connotation in Hillary Clinton and Donald Trump: Discourse Analysis of the 2016 Presidential Debates
    UNIVERSIDAD PONTIFICIA COMILLAS Facultad de Ciencias Humanas y Sociales Degree in Translation and Interpreting Final Degree Project Denotation and Connotation in Hillary Clinton and Donald Trump: Discourse analysis of the 2016 presidential debates Student: Markel Lezana Escribano Director: Dr Susan Jeffrey Campbell Madrid, 8th June 2017 Index List of Tables…………………………………………………………………………….i 1. Introduction .............................................................................................................. 3 2. Theoretical Framework............................................................................................. 5 2.1 Semantics ................................................................................................................ 5 2.2 Discourse Analysis ................................................................................................. 9 2.2.1 Functional Discourse Analysis ........................................................................ 9 2.2.2 Critical Discourse Analysis ........................................................................... 10 2.2.3 Political Discourse Analysis .......................................................................... 10 2.3 Pragmatics ............................................................................................................ 10 2.4 Tools of Analysis .................................................................................................. 11 2.4.1 Functions of Language .................................................................................
    [Show full text]
  • Invitation to Semantics
    Varieties of meaning http://www-rohan.sdsu.edu/~gawron/semantics Jean Mark Gawron San Diego State University, Department of Linguistics 2012-01-25 Ling 525 Jean Mark Gawron ( SDSU ) Gawron: Semantics intro 2012-01-25 Ling 525 1 / 59 Outline 1 Semantics and pragmatics 2 Lexical vs. structural meaning 3 Sense and denotation 4 Determining denotations 5 Sentence denotations 6 Intensions and possible worlds 7 Conclusion Jean Mark Gawron ( SDSU ) Gawron: Semantics intro 2012-01-25 Ling 525 2 / 59 Outline 1 Semantics and pragmatics 2 Lexical vs. structural meaning 3 Sense and denotation 4 Determining denotations 5 Sentence denotations 6 Intensions and possible worlds 7 Conclusion Jean Mark Gawron ( SDSU ) Gawron: Semantics intro 2012-01-25 Ling 525 3 / 59 What is semantics? Definition Semantics Semantics is the study of the meaning of linguistic forms, what the words and the syntax contribute to what is communicated. Jean Mark Gawron ( SDSU ) Gawron: Semantics intro 2012-01-25 Ling 525 4 / 59 Literal meaning We call the meaning of a linguistic form its literal meaning. Sentence Literal meaning I forgot the paper Past forget(I, the paper) At some time in the past, someone forgets something [forget( , )] The speaker is the someone. The paper is the something. Each part of the sentence contributes something to this literal meaning. I the speaker of the utterance the paper an object appropriately describable as a paper forget the relation that holds between an indi- vidual and something they forget Past Tense (ed) the relation holds in the past Jean Mark Gawron ( SDSU ) Gawron: Semantics intro 2012-01-25 Ling 525 5 / 59 Semantics and pragmatics Literal meaning excludes a lot of what might actually be communicated on a particular occasion of utterance.
    [Show full text]
  • 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.
    [Show full text]
  • How to Define Theoretical Terms Author(S): David Lewis Reviewed Work(S): Source: the Journal of Philosophy, Vol
    Journal of Philosophy, Inc. How to Define Theoretical Terms Author(s): David Lewis Reviewed work(s): Source: The Journal of Philosophy, Vol. 67, No. 13 (Jul. 9, 1970), pp. 427-446 Published by: Journal of Philosophy, Inc. Stable URL: http://www.jstor.org/stable/2023861 . Accessed: 14/10/2012 20:19 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp . JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Journal of Philosophy, Inc. is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Philosophy. http://www.jstor.org THE JOURNAL OF PHILOSOPHY VOLUME LXVII, NO. I3, JULY 9, 19-0 HOW TO DEFINE THEORETICAL TERMS M OST philosophers of science agree that, when a newly proposed scientific theory introduces new terms, we usually cannot define the new terms using only the old terms we understood beforehand. On the contrary, I contend that there is a general method for defining the newly introduced theo- retical terms. Most philosophers of science also agree that, in order to reduce one scientific theory to another, we need to posit bridge laws: new laws, independent of the reducing theory, which serve to identify phenomena described in terms of the reduced theory with phe nomena described in terms of the reducing theory.
    [Show full text]
  • 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.
    [Show full text]
  • Frege: “On Sense and Denotation”
    Frege: “On Sense and Denotation” TERMIOLOGY • ‘On Sense and Nominatum’ is a quirky translation of ‘ Über Sinn und Bedeutung’. ‘On Sense and Denotation’ is the usual translation. • ‘Sameness’ is misleading in stating the initial puzzle. As Frege’s n.1 makes clear, the puzzle is about identity . THE PUZZLE What is identity? Is it a relation? If it is a relation, what are the relata? Frege considers two possibilities: 1. A relation between objects. 2. A relation between names (signs). (1) leads to a puzzle; (2) is the alternative Frege once preferred, but now rejects. The puzzle is this: if identity is a relation between objects, it must be a relation between a thing and itself . But everything is identical to itself, and so it is trivial to assert that a thing is identical to itself. Hence, every statement of identity should be analytic and knowable a priori . The “cognitive significance” of ‘ a = b ’ would thus turn out to be the same as that of ‘a = a’. In both cases one is asserting, of a single object, that it is identical to itself. Yet, it seems intuitively clear that these statements have different cognitive significance: “… sentences of the form a = b often contain very valuable extensions of our knowledge and cannot always be justified in an a priori manner” (p. 217). METALIGUISTIC SOLUTIO REJECTED In his Begriffschrift (1879), Frege proposed a metalinguistic solution: identity is a relation between signs. ‘ a = b’ thus asserts a relation between the signs ‘ a’ and ‘ b’. Presumably, the relation asserted would be being co-referential .
    [Show full text]
  • 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).
    [Show full text]
  • 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
    [Show full text]
  • Chapter 3 – Describing Syntax and Semantics CS-4337 Organization of Programming Languages
    !" # Chapter 3 – Describing Syntax and Semantics CS-4337 Organization of Programming Languages Dr. Chris Irwin Davis Email: [email protected] Phone: (972) 883-3574 Office: ECSS 4.705 Chapter 3 Topics • Introduction • The General Problem of Describing Syntax • Formal Methods of Describing Syntax • Attribute Grammars • Describing the Meanings of Programs: Dynamic Semantics 1-2 Introduction •Syntax: the form or structure of the expressions, statements, and program units •Semantics: the meaning of the expressions, statements, and program units •Syntax and semantics provide a language’s definition – Users of a language definition •Other language designers •Implementers •Programmers (the users of the language) 1-3 The General Problem of Describing Syntax: Terminology •A sentence is a string of characters over some alphabet •A language is a set of sentences •A lexeme is the lowest level syntactic unit of a language (e.g., *, sum, begin) •A token is a category of lexemes (e.g., identifier) 1-4 Example: Lexemes and Tokens index = 2 * count + 17 Lexemes Tokens index identifier = equal_sign 2 int_literal * mult_op count identifier + plus_op 17 int_literal ; semicolon Formal Definition of Languages • Recognizers – A recognition device reads input strings over the alphabet of the language and decides whether the input strings belong to the language – Example: syntax analysis part of a compiler - Detailed discussion of syntax analysis appears in Chapter 4 • Generators – A device that generates sentences of a language – One can determine if the syntax of a particular sentence is syntactically correct by comparing it to the structure of the generator 1-5 Formal Methods of Describing Syntax •Formal language-generation mechanisms, usually called grammars, are commonly used to describe the syntax of programming languages.
    [Show full text]
  • Frege and the Logic of Sense and Reference
    FREGE AND THE LOGIC OF SENSE AND REFERENCE Kevin C. Klement Routledge New York & London Published in 2002 by Routledge 29 West 35th Street New York, NY 10001 Published in Great Britain by Routledge 11 New Fetter Lane London EC4P 4EE Routledge is an imprint of the Taylor & Francis Group Printed in the United States of America on acid-free paper. Copyright © 2002 by Kevin C. Klement All rights reserved. No part of this book may be reprinted or reproduced or utilized in any form or by any electronic, mechanical or other means, now known or hereafter invented, including photocopying and recording, or in any infomration storage or retrieval system, without permission in writing from the publisher. 10 9 8 7 6 5 4 3 2 1 Library of Congress Cataloging-in-Publication Data Klement, Kevin C., 1974– Frege and the logic of sense and reference / by Kevin Klement. p. cm — (Studies in philosophy) Includes bibliographical references and index ISBN 0-415-93790-6 1. Frege, Gottlob, 1848–1925. 2. Sense (Philosophy) 3. Reference (Philosophy) I. Title II. Studies in philosophy (New York, N. Y.) B3245.F24 K54 2001 12'.68'092—dc21 2001048169 Contents Page Preface ix Abbreviations xiii 1. The Need for a Logical Calculus for the Theory of Sinn and Bedeutung 3 Introduction 3 Frege’s Project: Logicism and the Notion of Begriffsschrift 4 The Theory of Sinn and Bedeutung 8 The Limitations of the Begriffsschrift 14 Filling the Gap 21 2. The Logic of the Grundgesetze 25 Logical Language and the Content of Logic 25 Functionality and Predication 28 Quantifiers and Gothic Letters 32 Roman Letters: An Alternative Notation for Generality 38 Value-Ranges and Extensions of Concepts 42 The Syntactic Rules of the Begriffsschrift 44 The Axiomatization of Frege’s System 49 Responses to the Paradox 56 v vi Contents 3.
    [Show full text]