Abstract: Semantics is the analysis and synthesis of programming structures. It aims to provide a theory of computability beyond traditional Turing computability, as well as a foundation for unifying various programming concepts. We illustrate these key features of semantics via three examples, and discuss possible sources of semantic theories.
From the introduction: Suppose TrustMe is a web site that offers a new program for filing a federal tax return electronically with the IRS. It runs within your web browser and has all the latest forms, reflecting recent changes in the tax law. You're happy because it means that now you don't have to buy and install software for this purpose that may be obsolete next year. Instead, you can just rent it once for a small fee.
Now, you know the program has only two output channels, each of which uses a network interface---one channel is used to send your return to the IRS and the other is used to send billing information to TrustMe for the fee. You also know that it encrypts all information before it is sent on these channels using public keys belonging to TrustMe and the IRS. Since your browser runs the program, you take advantage of its security features by configuring it to be in "paranoid mode"---any attempt by the code to read or write will be trapped, causing a dialog box to appear requesting permission. After you complete your return, you are asked for billing information and then one of these boxes appears. How do you respond? Saying "no", might cause the program to terminate abnormally. On the other hand, saying "yes" also seems risky. How do you know this is not an attempt to send information about your return back to TrustMe as well?
From the introduction: Abstraction is one of the pillars of computer science. Of course, choosing the right concepts to emphasize, and details to suppress, is crucial in all of science, but in computer science the role of abstraction extends beyond that of sensible methodology. For in computing we have seen the emergence of an array of constructs and methods whose chief purpose is to provide general mechanisms for achieving, validating, or enforcing abstraction, rather than being specific instances or examples of it. Among these are programming concepts such as objects, procedures, abstract data types and modules, and mathematical methods such as simulation and logical relations.
But what, more precisely, is the "abstraction" achieved by these constructs? In the case of procedural abstraction, a more or less satisfactory explanation can be given in terms of functions. Much more subtle, and novel, is the idea of data abstraction: A collection of programs or operations conspiring together to represent higher level pieces of data.
From the introduction: The Twenty-Sixth SIGPLAN-SIGACT Principles of Programming Languages (POPL) conference was held on January 20-22, 1999. Over 200 participants, an increase over last year's attendance, met in San Antonio, Texas. Three smaller conferences or workshops were also scheduled around the conference. Andrew Appel of Princeton served as general chair, with the program chosen by a committee led by Alex Aiken of Berkeley. Rather than give a detailed discussion of the conference, I will focus on some of the highlights.
From the introduction: Practically all programming languages have some form of control structure or jumping. The more advanced forms of control structure tend to resemble function calls, so much so that they are usually not even described as jumps. Consider for example the library function "exit" in C. Its use is much like a function, in that it may be called with an argument; but the whole point of "exit" is of course that its behaviour is utterly non-functional, in that it jumps out of arbitrarily many surrounding blocks and pending function calls. Such a "non-returning function" or "jump with arguments" is an example of a continuation in the sense which we are interested in here.
From the introduction: In recent years there has been a growing interest in programming languages with the property that all definable functions belong to some complexity class, often polynomial time or space. This research has established a link between computational complexity theory and the fields of type systems and programming language semantics with emerging applications to resource certification and programming under resource restrictions as arise in embedded systems. The purpose of this article is to survey this development beginning from Cobham's 1965 result which was the first in the area, up to the current research frontier.