Loglan 88 Report On The Programming Language

LOGLAN '88 belongs to the family of object oriented programming languages. It embraces all important known tools and characteristics of OOP, i.e. classes, objects, inheritance, coroutine sequencing, but it does not get rid of traditional imperative programming: primitive types do not need to be objects; records, static arrays, subtypes and other similar type contructs are admitted. LOGLAN has non-traditional memory model which accepts programmed deallocation but avoids dangling reference. The LOGLAN semantic model provides multi-level inheritance, which properly cooperates with module nesting. Parallelism in LOGLAN has an object oriented nature. Processes are treated like objects of classes and communication between processes is provided by alien calls similar to remote calls.

This book introduces readers to selected issues in distributed systems, and primarily focuses on principles, not on technical details. Though the systems discussed are based on existing (von Neumann) computer architectures, the book also touches on emerging processing paradigms. Uniquely, it approaches system components not only as static constructs, but also “in action,” exploring the different states they pass through. The author’s teaching experience shows that newcomers to the field, students and even IT professionals can far more readily grasp the essence of distributed algorithmic structures in action, than on the basis of static descriptions.

This volume consists of the papers accepted for presentation at the second international workshop on Programming Language Implementation and Logic Programming (PLILP '90) held in Linköping, Sweden, August 20-22, 1990. The aim of the workshop was to identify concepts and techniques used both in implementation of programming languages, regardless of the underlying programming paradigm, and in logic programming. The intention was to bring together researchers working in these fields. The volume includes 26 selected papers falling into two categories. Papers in the first category present certain ideas from the point of view of a particular class of programming languages, or even a particular language. The ideas presented seem to be applicable in other classes of languages. Papers in the second category directly address the problem of integration of various programming paradigms. The proceedings of the predecessor workshop PLILP '88, held in Orléans, France, May 16-18, 1988, are available as Lecture Notes in Computer Science, Vol. 348.

In subvolume 27C1 magnetic and related properties of binary lanthanide oxides have been compiled. This subvolume covers data obtained since 1980 and can therefore be regarded as supplement to volume III/12c. While in the previous volume the majority of magnetic data was obtained either from magnetometric measurements or from neutron diffraction, for the present data the main emphasis is devoted to 'related' properties without which, however, the understanding of classical magnetic properties is impossible. A second part 27C2 will deal with binary oxides of the actinide elements.

The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.

After Ole-Johan’s retirement at the beginning of the new millennium, some of us had thought and talked about making a “Festschrift” in his honor. When Donald Knuth took the initiative by sending us the ?rst contribution, the p- cess began to roll! In early 2002 an editing group was formed, including Kristen Nygaard, who had known Ole-Johan since their student days, and with whom he had developed the Simula language. Then we invited a number of prominent researchers familiar with Ole-Johan to submit contributions for a book hon- ing Ole-Johan on the occasion of his 70th birthday. Invitees included several members of the IFIP 2. 3 working group, a forum that Ole-Johan treasured and enjoyedparticipating in throughouthis career. In spite of the shortdeadline, the response to the invitations was overwhelmingly positive. The original idea was to complete the book rather quickly to make it a gift he could read and enjoy, because by then he had had cancer for three years, and his health was gradually deteriorating. Kristen had been regularly visiting Ole-Johan,who was in the hospitalat that time, and they were workingon their Turing award speech. Ole-Johan was grati?ed to hear about the contributions to this book, but modestly expressed the feeling that there was no special need to undertake a book project on his behalf. Peacefully accepting his destiny, Ole- Johan died on June 29, 2002.

Professor Nicholas N Govorun, corresponding member of the USSR Academy of Sciences, was the principal organizer of the precedent meetings held at Dubna (1979, 1983, 1985). Unfortunately, he passed away in 1989. This volume is to honor his support in Computer Algebra.This is perhaps the only meeting of the entire soviet union computer algebra community and foreign scientists. The meeting presented scientific results, plans for research facilities, and status reports of the basic areas of investigations. The fields covered include computer algebra systems and general algorithms as well as applied algorithms, programs and results in computer algebra applications (mainly in physics).

This volume presents selected papers from KBCS '89, which is the second in a series of annual conferences hosted by the Knowledge Based Computer Systems Project funded by the Government of India with United Nations assistance. The papers are grouped into sections including: - AI applications - computer architecture and parallel processing - expert systems - intelligent tutoring systems - knowledge representation - logic programming - natural language understanding - pattern recognition - reasoning - search - activities at the KBCS Nodal Centres.