[ WWWFun | Home ]

Research Topics

Selective Lambda-Calculus. Transformation Calculus.

I am interested in the area going from lambda-calculus to type theory, including process calculi. I more particularly work on two groups of calculi, which are described in detail in my doctor thesis:

Label-Selective Lambda-Calculi and Transformation Calculi, (March 1995)

Selective Lambda-Calculus

The selective lambda-calculus extends lambda-calculus with what we call selective currying. That is the possibility of passing arguments to functions in any order thanks to a labeling based on both symbolic keywords and numerical indexes.

The following three papers are available.

Label-selective lambda-calculus : syntax and confluence (December 1993 and November 1995)
The typed polymorphic label-selective lambda-calculus (January 1994)
A label-selective lambda-calculus with optional arguments and its compilation method (October 1995)

The last paper was implemented as Label Special Light.

Transformation Calculus

The transformation calculus is an extension of selective lambda-calculus. Namely a composition construct was added, which allows arguments to flow through terms seen as transformations.

These papers deal with it.

Introducing stateful objects in a transformation calculus (March 1993)
The transformation calculus and its typing (July 1993)
The transformation calculus (April 1994 and December 1995)
Dynamic binding and lexical binding in a transformation calculus (July 1995)

The toy language FIML is a strongly typed implementation of it.

JG 96.3.26