Data linkage algebra, data linkage dynamics, and priority rewriting

We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions. We describe the state changes and replies that result from performing those actions by means of a term rewriting system with rule priorities. The model in question is an upgrade of molecular dynamics. The upgrading is mainly concerned with the features to deal with values and the features to reclaim garbage.Comment: 48 pages, typos corrected, phrasing improved, definition of services replaced; presentation improved; presentation improved and appendix adde

Bitcoin and Islamic Finance

It is argued that a Bitcoin-style money-like informational commodity may constitute an effective instrument for the further development of Islamic Finance. The argument involves the following elements: (i) an application of circulation theory to Bitcoin with the objective to establish the implausibility of interest payment in connection with Bitcoin, (ii) viewing a Bitcoin-like system as a money-like exclusively informational commodity with the implication that such a system need not support debt, (iii) the idea that Islamic Finance imposes different requirements compared to conventional financial policies on a money concerning its use as a tool for achieving social and economic objectives, and (iv) identification of two aspects of mining, gambling and lack of trust, that may both be considered problematic from the perspective of compliance with the rules of Islamic Finance and a corresponding proposal to modify the architecture of mining in order to improve compliance with these rules

Data linkage dynamics with shedding

We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined whether or not the link will possibly be used once again by the program, and if not the link is automatically removed. Thus, everything is made garbage as soon as it can be viewed as garbage. By that, the effectiveness of garbage collection becomes maximal.Comment: 22 pages; introduction improved. arXiv admin note: substantial text overlap with arXiv:0804.456

Data linkage dynamics with shedding

We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined whether or not the link will possibly be used once again by the program, and if not the link is automatically removed. Thus, everything is made garbage as soon as it can be viewed as garbage. By that, the effectiveness of garbage collection becomes maximal