DIPARTIMENTO   DI   INFORMATICA
Università di Torino

Examples of raw terms that can given in input to the type inference algorithm.

SIMPLE TERMS:

(x)x.0;

<n>to m.in n.0 | (x)to x.0;

<m>0;

(nu m)<m>0;

x.y;


NOT TYPABLE:

<m>0|m[0]|(x)x.0;


MAILSERVER:

ms[mbox1[0] | mbox2[0]] | msg[in ms.in mbox2.to u2.<m>0]
| u1[in ms.in mbox1.(x)out mbox1.out ms.0]
| u2[in ms.in mbox2.(y)out mbox2.out ms.0];


TROJAN HORSE:

ulys[in horse.out horse.to pal.0]
| horse[in troy.0] | troy[pal[0]];


FIREWALL:

ag[(x)x.0] | (nu fw)fw[to ag.<in fw>0];



[Back]

Comments to: damiani[at]di[dot]unito[dot]it