ADlfcs.ps.Z:	Asperti, Dore. Yet another soundness criterion
		for multiplicative Linear Logic with MIX. 
		Logical Foundations of Comp. Sci. 
		San Petersburgh. 1994. 

BOHM.tar.Z:	Prototype implementation of a functional
		language based on a variant of Lamping's 
		graph reduction technique.

IS1.ps.Z:	Asperti Laneve. Interaction Systems I:
		the theory of optimal reduction. 
		Mathematical Structures in Comp. Sci. 
		To appear. 
		(an extension of Levy's theory of optimality
		for lambda calculus to a richer 
		source language). 

IS2.ps.gz:	Asperti Laneve. Interaction Systems II:
		the practice of optimal reduction. 
		Theoretical Comp. Sci. To appear.
		(the extension of Lampings's graph reduction
		technique for lambda calculus to Interaction
		Systems).

TCSfull.ps.Z:	Asperti Laneve. Paths Computations and Labels 
		in the lambda calculus. 
		Theoretical Comp. Sci. To appear.
		(Levy's labels viewed as paths in the 
                lambda term). 
		 
fundamenta.ps.Z: Asperti. Linear Logic, Comonads and 
		Optimal reductions. Fundamenta Informaticae.
		1995. 
		(A categorical interpretation of Lamping's
		 optimal graph reduction technique for the
		 lambda calculus).

safe.ps.Z:	Asperti. Optimizing optimal graph reduction 
		techniques. RTA'95. 
		(a partial solution to the problem of 
	         accumulation of control operators in 
	         optimal reduction).