1.Previous
3.Next

order to translate into the interaction calculus as using Lafont's notation.

The interaction calculus defines reduction on configurations in more details than seen from graphrewriting defined on interaction nets. Namely, if , the following reduction:

is called interaction. When one of equations has the form of , indirection can be applied resultingin substitution of the other occurrence of the name in some term :

or.

An equation is called a deadlock if has occurrence in term . Generally only deadlock-free interaction

1.Previous
3.Next