All traditional implementation techniques for functional languages fail to avoid useless
repetition of work. They are not" optimal" in their implementation of sharing, often causing a …

The book contains a completely new presentation of classical results in the field of Lambda
Calculus, together with new results. The text is unique in that it presents a new calculus …

Interaction nets provide a graphical paradigm of computation based on net rewriting. They
have proved most successful in understanding the dynamics of reduction in the λ-calculus …

We present an extension of the Interaction Abstract Machine (IAM) 10, 4 to full Linear Logic
with Girard's Geometry of Interaction (GoI)[6]. We propose a simplified way to interpret the …

This paper presents an efficient implementation of the λ-calculus using the graph rewriting
formalism of interaction nets. Building upon a series of previous works, we obtain one of the …

Page 1 Werner Kluge | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Abstract Computing Machines A
Lambda Calculus Perspective © Springer Page 2 Texts in Theoretical Computer Science An …

Starting from the-calculus. Moreover, since substitutions can move through abstractions and
reductions are allowed under abstractions (if certain conditions hold), closed reduction …

Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that
they are good only for strategies that are not very well understood (eg optimal reduction) and …

In this paper, we analyze the complexity of functional programs written in the interaction-net
computation model, an asynchronous, parallel and confluent model that generalizes linear …

The central new technical contribution presented by this dissertation is a reflective
framework for partial evaluation and rewriting, already used to compile a code generator for …