This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Bigraphical Reactive Systems have been proposed as a meta model for global ubiquitous computing generalising process calculi for mobility such as the pi-calculus and the Mobile Amb...
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
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...