The foundations of functional programming languages are examined from both historical
and technical perspectives. Their evolution is traced through several critical periods: early …

Dynamic properties characterize the behaviour of individual CP-nets, eg, whether it is
possible to reach a marking in which no step is enabled. It is often rather difficult to verify …

Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

In these lecture notes we describe an algebraic approach to programming, suitable both for
the derivation of individual programs and for the study of programming techniques in …

We present a pointer and array access checking technique that provides complete error
coverage through a simple set of program transformations. Our technique, based on an …

We study Girard's linear logic from the point of view of giving a concrete computational
interpretation of the logic, based on the Curry—Howard isomorphism. In the case of …

The new edition of this successful and established textbook retains its two original intentions
of explaining how to program in the ML language, and teaching the fundamentals of …

The Spineless Tagless G-machine is an abstract machine designed to support non-strict
higher-order functional languages. This presentation of the machine falls into three parts …

In this paper, we address the question of how to automatically map computational kernels to
highly efficient code for a wide range of computing platforms and establish the correctness of …

Paradigms of AI Programming is the first text to teach advanced Common Lisp techniques in
the context of building major AI systems. By reconstructing authentic, complex AI programs …