This book provides an introduction to the essential concepts in programming languages, using operational semantics techniques. It presents alternative programming language paradigms and gives an in-depth analysis of the most significant constructs in modern imperative, functional and logic programming languages. The book is designed to accompany lectures on programming language design for undergraduate students. Each chapter includes exercises which provide the opportunity to apply the concepts and techniques presented.

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

This open access book constitutes the proceedings of the 27th European Symposium on Programming, ESOP 2018, which took place in Thessaloniki, Greece in April 2018, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018. The 36 papers presented in this volume were carefully reviewed and selected from 114 submissions. The papers are organized in topical sections named: language design; probabilistic programming; types and effects; concurrency; security; program verification; program analysis and automated verification; session types and concurrency; concurrency and distribution; and compiler verification.

Computer scientists often need to learn new programming languages quickly. The best way to prepare for this is to understand the foundational principles that underlie even the most complicated industrial languages. This text for an undergraduate programming languages course distills great languages and their design principles down to easy-to-learn 'bridge' languages implemented by interpreters whose key parts are explained in the text. The book goes deep into the roots of both functional and object-oriented programming, and it shows how types and modules, including generics/polymorphism, contribute to effective programming. The book is not just about programming languages; it is also about programming. Through concepts, examples, and more than 300 practice exercises that exploit the interpreter, students learn not only what programming-language features are but also how to do things with them. Substantial implementation projects include Milner's type inference, both copying and mark-and-sweep garbage collection, and arithmetic on arbitrary-precision integers.

Programming Language Foundations is a concise text that covers a wide range of topics in the mathematical semantics of programming languages, for readers without prior advanced background in programming languages theory. The goal of the book is to provide rigorous but accessible coverage of essential topics in the theory of programming languages. Stump’s Programming Language Foundations is intended primarily for a graduate-level course in programming languages theory which is standard in graduate-level CS curricula. It may also be used in undergraduate programming theory courses but ONLY where students have a strong mathematical preparation.

On behalf of the organizing committee I would like to welcome you all to the second Asian Symposium on Programming Languages and Systems (APLAS 2004) held in Taipei on November 4–6, 2004. Since the year 2000, researchers in the area of programming languages and systems have been meeting annually in Asia to present their most recent research results, thus contributing to the advancementofthisresearcharea.ThelastfourmeetingswereheldinSingapore (2000), Daejeon (2001), Shanghai (2002), and Beijing (2003). These meetings were very fruitful and provided an excellent venue for the exchange of research ideas, ?ndings and experiences in programming languages and systems. APLAS 2004 is the ?fth such meeting and the second one in symposium setting. The ?rst symposium was held in Beijing last year. The success of the APLAS series is the collective result of many people’s contributions.ForAPLAS2004,?rstIwouldliketothankallthemembersofthe Program Committee, in particular the Program Chair Wei-Ngan Chin, for their hardworkinputtingtogetheranexcellentprogram.Iammostgratefultoinvited speakers, Joxan Ja?ar, Frank Pfenning, and Martin Odersky, who have traveled a long way to deliver their speeches at APLAS 2004. I would like to thank all the referees, who helped review the manuscripts, the authors, who contributed to the proceedings of APLAS 2004, the members of the Organizing Committee, who made considerable e?ort to organize this event, and all the participants present at this meeting. Without your support this symposium would not have been possible. Finally I would like to acknowledge the support of the Asian Association for Foundation of Software and Academia Sinica, Taiwan.

This book constitutes the refereed proceedings of the 6th Asian Symposium on Programming Languages and Systems, APLAS 2008, held in Bangalore, India, in December 2008. The 20 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 41 submissions. The symposium is devoted to all topics ranging from foundational to practical issues in programming languages and systems. The papers cover topics such as semantics, logics, foundational theory, type systems, language design, program analysis, optimization, transformation, software security, safety, verification, compiler systems, interpreters, abstract machines, domain-specific languages and systems, as well as programming tools and environments.

This book constitutes the refereed proceedings of the First Asian Symposium on Programming Languages and Systems, APLAS 2003, held in Beijing, China in November 2003. The 24 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 75 submissions. The papers are devoted to concurrency and parallelism, language implementation and optimization, mobile computation and security, program analysis and verification, program transformation and calculation, programming paradigms and language design, programming techniques and applications, program semantics, categorical and logical foundations, tools and environments, type theory and type systems.

This book constitutes the refereed proceedings of the 20th European Symposium on Programming, ESOP 2011, held in Saarbrücken, Germany, March 30—April 1, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 24 revised full papers presented together with one full length invited talk were carefully reviewed and selected from 93 full paper submissions. Papers were invited on all aspects of programming language research including: programming paradigms and styles, methods and tools to write and specify programs and languages, methods and tools for reasoning about programs, methods and tools for implementation, and concurrency and distribution.