We introduce a notion of guarded recursive (gr) datatype constructors, generalizing the
notion of recursive datatypes in functional programming languages such as ML and Haskell …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

The categorical notion of monad, used by Moggi to structure denotational descriptions, has
proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic …

This paper brings together two strands of machine learning of increasing importance: kernel
methods and highly structured data. We propose a general method for constructing a kernel …

This book provides a unique treatment of an important area of machine learning and
answers the question of how kernel methods can be applied to structured data. Kernel …

Reversibility is a key issue in the interface between computation and physics, and of
growing importance as miniaturization progresses towards its physical limits. Most …

This book is concerned with the rich and fruitful interplay between the fields of computational
logic and machine learning. The intended audience is senior undergraduates, graduate …

We show how higher kinded generic programming can be represented faithfully within a
dependently typed programming system. This development has been implemented using …

The type systems of most typed functional programming languages are based on the
Hindley-Milner type system. A practical problem with these type systems is that it is often …

Active objects offer a structured approach to concurrency, encapsulating both unshared
state and a thread of control. For efficient data transfer, data should be passed by reference …