The goal of the talk is to introduce a typed language of graph combinators and a theory on it as a model of sharing computations.

The design of sharing combinators will be developed by reasoning on a concrete, and non trivial example of sharing computations: those performed by BOHM Interpreter, which implements Optimal Reduction à la Levy for lambda calculus.