"Born in the 1360s, Andrey Rublev was a Muscovite monk and icon painter who died between 1427 and 1430 in Moscow. He is acknowledged as the supreme medieval Russian painter of icons and frescos, yet much about him remains mysterious. To date there is no volume in English on him or his work. This book addresses the gap, giving an overview of Rublev’s own times and later reputation, and taking in the most recent Rublev scholarship. It uses Russian-language material (including Old Russian), but is thoroughly accessible to the non-specialist reader. Andrey Rublev is profusely illustrated with previously unpublished images, bringing the story of Rublev’s ‘rediscovery’ right up to date.

First published in 1996, this collection of essays by distinguished computer scientists celebrates the achievements of research and speculates about the unsolved problems in computer science that require future investigation. Since the subject stretches from technology in the field, through engineering design to foundations in mathematics, there is a wide variety of concerns and approaches among the authors. The book's purpose is to show that long-term research in computer science is crucial and that it must not be driven solely by commercial considerations. The authors do not shirk the difficult aspects of their topics, but try to expose them in the simplest terms possible without diluting them, in order that the reader can understand the issues involved. Thus the book also represents a broad overview of much of the state of knowledge and future expectations of computer science, illustrating that it is much more than a technology and it is a fully fledged and growing intellectual discipline with its own engineering principles and its own scientific concepts and models. It will be stimulating reading because it represents the views of prominent authorities who have had a significant impact on the direction of innovation, research and development in computer science.

Communication is a fundamental and integral part of computing, whether between different computers on a network, or between components within a single computer. In this book Robin Milner introduces a new way of modelling communication that reflects its position. He treats computers and their programs as themselves built from communicating parts, rather than adding communication as an extra level of activity. Everything is introduced by means of examples, such as mobile phones, job schedualers, vending machines, data structures, and the objects of object-oriented programming. But the aim of the book is to develop a theory, the pi-calculus, in which these things can be treated rigorously. The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message--or indeed an entire computer program--across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcome by them, and their students.

First published in 1996, this collection of essays by distinguished computer scientists celebrates the achievements of research and speculates about the unsolved problems in computer science that require future investigation. Since the subject stretches from technology in the field, through engineering design to foundations in mathematics, there is a wide variety of concerns and approaches among the authors. The book's purpose is to show that long-term research in computer science is crucial and that it must not be driven solely by commercial considerations. The authors do not shirk the difficult aspects of their topics, but try to expose them in the simplest terms possible without diluting them, in order that the reader can understand the issues involved. Thus the book also represents a broad overview of much of the state of knowledge and future expectations of computer science, illustrating that it is much more than a technology and it is a fully fledged and growing intellectual discipline with its own engineering principles and its own scientific concepts and models. It will be stimulating reading because it represents the views of prominent authorities who have had a significant impact on the direction of innovation, research and development in computer science.

The world is increasingly populated with interactive agents distributed in space, real or abstract. These agents can be artificial, as in computing systems that manage and monitor traffic or health; or they can be natural, e.g. communicating humans, or biological cells. It is important to be able to model networks of agents in order to understand and optimise their behaviour. Robin Milner describes in this book just such a model, by presenting a unified and rigorous structural theory, based on bigraphs, for systems of interacting agents. This theory is a bridge between the existing theories of concurrent processes and the aspirations for ubiquitous systems, whose enormous size challenges our understanding. The book is reasonably self-contained mathematically, and is designed to be learned from: examples and exercises abound, solutions for the latter are provided. Like Milner's other work, this is destined to have far-reaching and profound significance.

Communication is a fundamental and integral part of computing, whether between different computers on a network, or between components within a single computer. In this book Robin Milner introduces a new way of modelling communication that reflects its position. He treats computers and their programs as themselves built from communicating parts, rather than adding communication as an extra level of activity. Everything is introduced by means of examples, such as mobile phones, job schedualers, vending machines, data structures, and the objects of object-oriented programming. But the aim of the book is to develop a theory, the pi-calculus, in which these things can be treated rigorously. The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message--or indeed an entire computer program--across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcome by them, and their students.

This volume contains a selection of early works by Yevgeny Alexandrovich Yevtushenko who blazed a trail for a generation of Soviet poets with a confident poetic voice that moves effortlessly between social and personal themes. 'Zima Junction' vividly describes his idyllic childhood in Siberia and his impressions of home after a long absence in Moscow. Private moments are captured in 'Waking', on the joys of discovering the unexpected in a lover, and 'Birthday', on a mother's concern for her son, while 'Encounter' depicts an unexpected meeting with Hemingway in Copenhagen. 'The Companion' and 'Party Card' show war from a child's eye, whether playing while oblivious to German bombs falling nearby or discovering a fatally wounded soldier in the forest, while Yevtushenko's famous poem, 'Babiy Yar', is an angry expose of the Nazi massacre of the Jews of Kiev.

Standard ML is a general-purpose programming language designed for large projects. This book provides a formal definition of Standard ML for the benefit of all concerned with the language, including users and implementers. Because computer programs are increasingly required to withstand rigorous analysis, it is all the more important that the language in which they are written be defined with full rigor.One purpose of a language definition is to establish a theory of meanings upon which the understanding of particular programs may rest. To properly define a programming language, it is necessary to use some form of notation other than a programming language. Given a concern for rigor, mathematical notation is an obvious choice. The authors have defined their semantic objects in mathematical notation that is completely independent of Standard ML.In defining a language one must also define the rules of evaluation precisely--that is, define what meaning results from evaluating any phrase of the language. The definition thus constitutes a formal specification for an implementation. The authors have developed enough of their theory to give sense to their rules of evaluation.The Definition of Standard ML is the essential point of reference for Standard ML. Since its publication in 1990, the implementation technology of the language has advanced enormously and the number of users has grown. The revised edition includes a number of new features, omits little-used features, and corrects mistakes of definition.

The world is increasingly populated with interactive agents distributed in space, real or abstract. These agents can be artificial, as in computing systems that manage and monitor traffic or health; or they can be natural, e.g. communicating humans, or biological cells. It is important to be able to model networks of agents in order to understand and optimise their behaviour. Robin Milner describes in this book just such a model, by presenting a unified and rigorous structural theory, based on bigraphs, for systems of interacting agents. This theory is a bridge between the existing theories of concurrent processes and the aspirations for ubiquitous systems, whose enormous size challenges our understanding. The book is reasonably self-contained mathematically, and is designed to be learned from: examples and exercises abound, solutions for the latter are provided. Like Milner's other work, this is destined to have far-reaching and profound significance.