Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and
software design and verification, unexpected mathematical beauty. The lambda calculus …

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 …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

The narrowing relation over terms constitutes the basis of the most important operational
semantics of languages that integrate functional and logic programming paradigms. It also …

Concurrent programming in ML | Guide books skip to main content ACM Digital Library home
ACM Association for Computing Machinery corporate logo Google, Inc. (search) Advanced …

The framework of graph transformation combines the potentials and advantages of both,
graphs and rules, to a single computational paradigm. In this paper we present some recent …

This paper presents a novel approach for integrating arrays with access time (1) into
functional languages. It introduces n-dimensional arrays combined with a type system that …

A programming course should concentrate on a program's logical structure and design
rather than on simply writing code. The functional approach to programming achieves this …

One of the most important contributions of A. Church to logic is his invention of the lambda
calculus. We present the genesis of this theory and its two major areas of application: the …