programs -Can define the set of traces -Can represent program counter implicitly -Handle gotos •Natural operational semantics is an abstraction •Different semantics may be used to justify different behaviors •Thinking in concrete semantics is essential for language designer/compiler writer/… In this article, we are rationalize concerning the programming languages which are effective for the controlling the behavior of a machine (frequently Computer).Like natural languages,programming Semantics of Programming Languages Exercise Sheet 12 Use the template le Ex12 Template.thy. Exercise 12.1 Warm-up Write a program MAX which stores the maximum value of the two variables 0 and 1 in variable 2. Verify MAX, i.e., prove the veri cation condition induced by MAX. Exercise 12.2 Multiplication Write a program MULTIPLY which computes the product of the two variables 0 and 1, storing Some uses of prog. lang. semantics • Providing a reference for compiler and tool writers. • Analysing the design of a programming language. • Developing and validating implementations of programming languages and tools • Developing and validating implementations of program analysis tools. • Verifying the correctness of programs. Aims. The aim of this course will be to introduce the structural, operational approach to programming language semantics. It will show how this formalism is used to specify the meaning of some simple programming language constructs and to reason formally about semantic properties of programs and of tools like program analyzers and compilers. School of Computer Science and Statistics B.A. (Mod) Computer Science ECTS Module Descriptor 2011-12 Module Code CS3017 Module Title Introduction to the Semantics of Programming Languages Pre-requisites Basic discrete mathematics, including elementary set theory, propositional logic and induction. Semantics of Programming Languages (IB CST) Cameron Ramsay (cfr26) 3 Functions Function application is left associative e 1 e 2 e 3 = (e 1 e 2)e 3 Type arrows are right associative T 1!T 2!T 3 = T 1!(T 2!T 3) fnextends as far right as parentheses permit Functions have the form fnx: T=>e Outside the fnbinding the name of the formal parameter does not matter. Within the fnbinding anything with 8.3. BNF Grammars for Programming Languages • We can define the syntax of a programming language use a BNF grammar. • Here is a BNF grammar for MOCCA corresponding to the syntax diagrams we saw in the previous lecture. • The start symbol is hprogrami. hprogrami ::= hblocki hblocki ::= { hcommand-listi } hcommand-listi ::= This chapter presents the syntax of a programming language, IMP, a small language of while programs. IMP is called an "imperative" language because program execution involves carrying out a series of explicit commands to change state. Formally, IMP's behaviour is described by rules which specify how its expressions are evaluated and its commands are executed. The rules provide an operational semantics of IMP in that they 1. 1 Reasons for Studying Concepts of Programming Languages- CO1 x Increased ability to express ideas x Improved background for choosing appropriate languages x Increased ability to learn new languages x Better understanding of significance of implementation x Overall advancement of computing 1. 2 Programming Domains ² CO1 Department of Computer Science and Technology . Log