In Handout 4, we have examined the reduction semantics of lambda calculus, and noted the difference between the normal order reduction, which chooses leftmost-outermost redexes for reduction at every stage, and the applicative order reduction, which chooses innermost redexes for reduction at every stage. We noted that the normal order reduction strategy is always able to find the normal form of...

In the present paper strong{monotonic, monotonic and weak{monotonic reasoning is studied in the context of algorithmic language learning theory from positive as well as from positive and negative data. Strong{monotonicity describes the requirement to only produce better and better generalizations when more and more data are fed to the inference device. Monotonic learning re ects the eventual in...

The Happenings department reports on past, present, and future events of interest to the history of computing. These events include conferences, appropriate sessions from meetings, exhibits, projects, awards, publications, collections, general memorabilia, and important dates in the history of computing. Contributions to the department are encouraged and should consist of a description or repor...

The paper explains the main idea of how the Estelle semantics may be reinterpreted within the queuing network model making possible a translation of Estelle into the algorithmic language of the Queuing Network Analysis Package (QNAP2). Such a translation gives access to all utilities of the package and enables the performance analysis to be integrated into the design process of Estelle specific...

This chapter focuses on institutional investors in the German financial markets. Institutional investors are specialized financial intermediaries who collect and manage funds on behalf of small investors toward specific objectives in terms of risk, return and maturity. The major types of institutional investors in Germany are insurance companies and investment funds. We will examine the nature ...

We present a denotational semantics for an Algol-like language Alg which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. In this preliminary report we concentrate on the construction of the denotational model and on the main ideas of the full abstraction proof. For more backgr...

We consider a parallel Algol-like language, combining procedures with shared-variable parallelism. Procedures permit encapsulation of common parallel programming idioms. Local variables provide a way to restrict interference between parallel commands. The combination of local variables, procedures, and parallelism supports a form of concurrent object-oriented programming. We provide a denotatio...

This paper presents the identification of a new programming language concept and reports our initial investigations of its utility. The concept is to identify persistence as an orthogonal property of data, independent of data type and the way in which data is manipulated. This is expressed by the principle that all data objects, independent of their data type, should have the same rights to per...