This is a comprehensive account of the semantics and the implementation of the whole Lisp family of languages, namely Lisp, Scheme and related dialects. It describes 11 interpreters and 2 compilers, including very recent techniques of interpretation and compilation. The book is in two parts. The first starts from a simple evaluation function and enriches it with multiple name spaces, continuations and side-effects with commented variants, while at the same time the language used to define these features is reduced to a simple lambda-calculus. Denotational semantics is then naturally introduced. The second part focuses more on implementation techniques and discusses precompilation for fast interpretation: threaded code or bytecode; compilation towards C. Some extensions are also described such as dynamic evaluation, reflection, macros and objects. This will become the new standard reference for people wanting to know more about the Lisp family of languages: how they work, how they are implemented, what their variants are and why such variants exist. The full code is supplied (and also available over the Net). A large bibliography is given as well as a considerable number of exercises. Thus it may also be used by students to accompany second courses on Lisp or Scheme.

Several carefully revised lectures from the 6th International School on Functional Programming, AFP 2008, are presented in this valuable review. Topics include computation with Delta ML, spider spinning, reduction-based normalization and Haskell programming.

The final quarter of the 20th century has seen the establishment of a global computational infrastructure. This and the advent of programming languages such as Java, supporting mobile distributed computing, has posed a significant challenge to computer sciences. The infrastructure can support commerce, medicine and government, but only if communications and computing can be secured against catastrophic failure and malicious interference.

Multithreaded computer architecture has emerged as one of the most promising and exciting avenues for the exploitation of parallelism. This new field represents the confluence of several independent research directions which have united over a common set of issues and techniques. Multithreading draws on recent advances in dataflow, RISC, compiling for fine-grained parallel execution, and dynamic resource management. It offers the hope of dramatic performance increases through parallel execution for a broad spectrum of significant applications based on extensions to `traditional' approaches. Multithreaded Computer Architecture is divided into four parts, reflecting four major perspectives on the topic. Part I provides the reader with basic background information, definitions, and surveys of work which have in one way or another been pivotal in defining and shaping multithreading as an architectural discipline. Part II examines key elements of multithreading, highlighting the fundamental nature of latency and synchronization. This section presents clever techniques for hiding latency and supporting large synchronization name spaces. Part III looks at three major multithreaded systems, considering issues of machine organization and compilation strategy. Part IV concludes the volume with an analysis of multithreaded architectures, showcasing methodologies and actual measurements. Multithreaded Computer Architecture: A Summary of the State of the Art is an excellent reference source and may be used as a text for advanced courses on the subject.

The book provides a description of the Standard ML (SML) Basis Library, the standard library for the SML language. For programmers using SML, it provides a complete description of the modules, types and functions composing the library, which is supported by all conforming implementations of the language. The book serves as a programmer's reference, providing manual pages with concise descriptions. In addition, it presents the principles and rationales used in designing the library, and relates these to idioms and examples for using the library. A particular emphasis of the library is to encourage the use of SML in serious system programming. Major features of the library include I/O, a large collection of primitive types, support for internationalization, and a portable operating system interface. This manual will be an indispensable reference for students, professional programmers, and language designers.

It is over 20 years since the functional data model and functional programming languages were first introduced to the computing community. Although developed by separate research communities, recent work, presented in this book, suggests there is powerful synergy in their integration. As database technology emerges as central to yet more complex and demanding applications in areas such as bioinformatics, national security, criminal investigations and advanced engineering, more sophisticated approaches like those presented here, are needed. A tutorial introduction by the editors prepares the reader for the chapters that follow, written by leading researchers, including some of the early pioneers. They provide a comprehensive treatment showing how the functional approach provides for modeling, analyzis and optimization in databases, and also data integration and interoperation in heterogeneous environments. Several chapters deal with mathematical results on the transformation of expressions, fundamental to the functional approach. The book also aims to show how the approach relates to the Internet and current work on semistructured data, XML and RDF. The book presents a comprehensive view of the functional approach to data management, bringing together important material hitherto widely scattered, some new research, and a comprehensive set of references. It will serve as a valuable resource for researchers, faculty and graduate students, as well as those in industry responsible for new systems development.

This volume presents the tutorials given during the First International Spring School on Advanced Functional Programming Techniques, held in Bastad, Sweden in May 1995. The last few years have seen important new developments in functional programming techniques: concepts, such as monads, type classes, and several new special purpose libraries of higher-order functions are new and powerful methods for structuring programs. This book brings programmers, software engineers and computer scientists up-to-date with the latest techniques. Most tutorial contributions contain exercises to familiarize the reader with the new concepts and techniques, and only basic knowledge in functional programming is assumed.

Although the theory of object-oriented programming languages is far from complete, this book brings together the most important contributions to its development to date, focusing in particular on how advances in type systems and semantic models can contribute to new language designs.The fifteen chapters are divided into five parts: Objects and Subtypes, Type Inference, Coherence, Record Calculi, and Inheritance. The chapters are organized approximately in order of increasing complexity of the programming language constructs they consider - beginning with variations on Pascal- and Algol-like languages, developing the theory of illustrative record object models, and concluding with research directions for building a more comprehensive theory of object-oriented programming languages.Part I discusses the similarities and differences between "objects" and algebraic-style abstract data types, and the fundamental concept of a subtype. Parts II-IV are concerned with the "record model" of object-oriented languages. Specifically, these chapters discuss static and dynamic semantics of languages with simple object models that include a type or class hierarchy but do not explicitly provide what is often called dynamic binding. Part V considers extensions and modifications to record object models, moving closer to the full complexity of practical object-oriented languages.Carl A. Gunter is Professor in the Department of Computer and Information Science at the University of Pennsylvania. John C. Mitchell is Professor in the Department of Computer Science at Stanford University.

This, the 28th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains extended and revised versions of six papers presented at the 26th International Conference on Database- and Expert-Systems Applications, DEXA 2015, held in Valencia, Spain, in September 2015. Topics covered include efficient graph processing, machine learning on big data, multistore big data integration, ontology matching, and the optimization of histograms for the Semantic Web.

This volume constitutes the proceedings of the third International Workshop on Static Analysis (WSA`93), held in Padova, Italy, in September 1993. The objective of the international workshop series WSA is to serve as a forum for the discussion of the various aspects of static analysis in different programming paradigms. The clearly increasing mumbers of submitted papers and workshop participants point out the growing importance of static analysis techniques for logical, functional, concurrent and parallel languages as well as for parallel term rewriting systems. This proceedings contains, besides the abstracts or full papers of the invited talks given by Pascal Van Hentenryck, Peter van Roy, and Paul Hudak, full versions of the 20 contributed papers selected from a total of 68 submissions by an international program committee consisting of many renown researchers in the field. The volume is organized in sections on fixpoint computation, concurrency, parallelism, transformation, logic programs, term rewriting systems, strictness, reasoning about programs, and types.