We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
The executions of operating system services based on smart cards allow one to personalize some functionalities of the operating system by using the secret information stored in a s...
Beginning with the adoption of the de-facto standard for wireless LAN communications IEEE 802.11 in 1999 we can observe a continuous growth of public wireless LAN hotspots that pro...