Resource control and intersection types: an intrinsic connection

In this paper we investigate the $\lambda$ -calculus, a $\lambda$-calculus enriched with resource control. Explicit control of resources is enabled by the presence of erasure and duplication operators, which correspond to thinning and con-traction rules in the type assignment system. We introduce directly the class of $\lambda$ -terms and we provide a new treatment of substitution by its decompo-sition into atomic steps. We propose an intersection type assignment system for $\lambda$ -calculus which makes a clear correspondence between three roles of variables and three kinds of intersection types. Finally, we provide the characterisation of strong normalisation in $\lambda$ -calculus by means of an in-tersection type assignment system. This process uses typeability of normal forms, redex subject expansion and reducibility method.Comment: arXiv admin note: substantial text overlap with arXiv:1306.228

TellEat: sharing experiences on the move

In a context where, due to the proliferation of mobile devices, virtual social environments on the Web are taking up a very concrete role in the way people experience their surroundings, the Future Internet seems to be headed toward a mixture of Social Web, Semantic Web and Augmented Reality. As a part of a larger project that aims at building a social network of both people and things, we designed and developed TellEat, an iPhone-based application that allows users in mobility to share facts concerning people or objects that participate in the social network, and to discover pertinent events that have been told by others. In this paper we discuss both the client application, with the interaction model and interface metaphors that have been designed to make the experience as playful as possible for users, and the server-side services that provide the necessary knowledge and reasoning mechanisms. We also present the results of preliminary tests with users