Differential Calculus on qq-Deformed Light-Cone

We propose the ``short'' version of q-deformed differential calculus on the light-cone using twistor representation. The commutation relations between coordinates and momenta are obtained. The quasi-classical limit introduced gives an exact shape of the off-shell shifting.Comment: 11 pages, Standard LaTeX 2.0

From moral welfarism to technical non-welfarism : A step back to Bentham’s felicific calculus of its members

A focus on the information used in Bentham’s felicific calculus sheds new light on the contemporary debate in normative economics opposing non-welfarism to welfarism. As a utilitarian, Bentham is de facto welfarist on a moral sense. Unexpectedly, this study shows Bentham resorts to non-welfarist information in his calculus. Thus, technical non-welfarism is coherent with moral welfarism, and even, the former proves necessary not to betray utilitarian principles. To sustain this claim, we challenge a view opposing a “cardinal” to an “ordinal” calculus: these two calculi constitute different stages of a unique calculus; because of operational constraints, Bentham is bound to rely on proxies, hence on non-utility information.Bentham, individual utility, utility calculus, utilitarianism, welfarism, non-welfarism, social welfare, technical welfarism, moral welfarism.

An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus

This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed ring structure K we define an extension of Terui's light affine lambda-calculus typed in LAL (Light Affine Logic) with a basic type for K. We show that this calculus captures the polynomial time function class FP(K): every typed term can be evaluated in polynomial time and conversely every polynomial time BSS machine over K can be simulated in this calculus.Comment: 11 pages. A preliminary version appeared as Research Report IAC CNR Roma, N.57 (11/2004), november 200

Light Logics and the Call-by-Value Lambda Calculus

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allows regaining strong connections with the underlying logic. This will be done in the context of Elementary Affine Logic (EAL), designing a type system in natural deduction style assigning EAL formulae to lambda terms.Comment: 28 page

A Typed Model for Linked Data

The term Linked Data is used to describe ubiquitous and emerging semi-structured data formats on the Web. URIs in Linked Data allow diverse data sources to link to each other, forming a Web of Data. A calculus which models concurrent queries and updates over Linked Data is presented. The calculus exhibits operations essential for declaring rich atomic actions. The operations recover emergent structure in the loosely structured Web of Data. The calculus is executable due to its operational semantics. A light type system ensures that URIs with a distinguished role are used consistently. The main theorem verifies that the light type system and operational semantics work at the same level of granularity, so are compatible. Examples show that a range of existing and emerging standards are captured. Data formats include RDF, named graphs and feeds. The primitives of the calculus model SPARQL Query and the Atom Publishing Protocol. The subtype system is based on RDFS, which improves interoperability. Examples focuss on the SPARQL Update proposal for which a fine grained operational semantics is developed. Further potential high level languages are outlined for exploiting Linked Data