This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
Giuseppe Castagna, Rocco De Nicola, Daniele Varacc...
In protocol development for wireless systems, the choice of appropriate mobility models describing the movement patterns of devices has long been recognised as a crucial factor for...
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...