Storage systems based on weak consistency provide better availability and lower latency than systems that use strong consistency, especially in geo-replicated settings. However, under weak consistency, it is harder to ensure the correctness of applications, as the execution of uncoordinated operations may lead to invalid states. In this paper we show how to modify an application to make it run ...

Based on a name-passing calculus and on its typing system we show how to build several language constructors towards strongly-typed concurrent programming languages. In particular, we introduce a notion of datatype declaration , and show how to create values of a datatype and how to take such values apart. Further expressions include a form of abstraction and of application. Expressions evaluat...

Weakly-typed languages such as Cobol often force programmers to represent distinct data abstractions using the same low-level physical type. In this paper, we describe a technique to recover implicitlydefined data abstractions from programs using type inference. We present a novel system of dependent types which we call guarded types, a pathsensitive algorithm for inferring guarded types for Co...

Automatic differentiation (AD) is a useful tool for computing Jacobians of functions needed in estimation and control algorithms. However, for many interesting problems in robotics, state variables live on a differentiable manifold. The most common example are robot orientations that are elements of the Lie group SO(3). This causes problems for AD algorithms that only consider differentiation a...

Given a rotation invariant measure in Rn, we define the maximal operator over circular sectors. We prove that it is of strong type (p, p) for p > 1 and we give necessary and sufficient conditions on the measure for the weak type (1, 1) inequality. Actually we work in a more general setting containing the above and other situations. Let X be a topological space and μ be a Borel measure on X. By ...

in this paper, we introduce a one-step iterative scheme for finding a common fixed point of a finite family of multivalued quasi-nonexpansive mappings in a real uniformly convex banach space. we establish weak and strong convergence theorems of the propose iterative scheme under some appropriate conditions.

begin{abstract} in this paper, we prove some strong and weak convergence of three step random iterative scheme with errors to common random fixed points of three asymptotically nonexpansive nonself random mappings in a real uniformly convex separable banach space. end{abstract}