Static analysis of logic programs by abstract interpretation requires designing abstract operators which mimic the concrete ones, such as unification, renaming, and projection. In the case of goal-driven analysis, where goal-dependent semantics are used, we also need a backward-unification operator, typically implemented through matching. In this paper, we study the problem of deriving optimal abstract matching operators for sharing and linearity properties. We provide an optimal operator for matching in the domain $\mathtt{ShLin}^{\omega }$, which can be easily instantiated to derive optimal operators for the domains $\mathtt{ShLin}^2$ by Andy King and the reduced product $\mathtt{Sharing} \times \mathtt{Lin}$.

This article describes how Taiwanese farmers adopted irrigation pumps to enhance their livelihoods under the shifting relationship of sugar and rice production in late colonial Taiwan. I argue that farmers utilized commercial technologies to make a living and prosper within the established order of Japanese colonial rule. With allocated procurement districts granting exclusive purchasing rights over sugarcane, sugar companies maintained substantial influence over sugarcane cultivation. However, with the proliferation of Penglai rice and new agricultural implements, the situation of the farmers changed substantially. Serious problems in the sugar industry due to economic depression and the rising price of rice in the 1930s led farmers to shift from sugarcane to rice cultivation by introducing a variety of pumps. Those with the means installed new motor pumps, while others independently constructed wind pumps by combining newly introduced parts with older techniques. Despite a prohibition by the colonial government, farmers continued installing pumps until the government established a planned economy in preparation for war. Moreover, distribution of pump capacity through both sales and sharing shows that Taiwanese farmers sought to maintain an informal yet significant cohesion throughout the process of agricultural commercialization. By focusing on the social dynamics surrounding agricultural technologies, this article challenges simplistic portrayals of technology transfer from Japan to the colonies.

Research demonstrates substantial urban consumption of wildmeat and the existence of trade networks in the Brazilian Amazon. Yet rural–urban mobility persists in this urbanized region, with the circulation of people, goods and ideas, blurring boundaries between rural and urban lives. Here we examined the relationships between rural–urban mobility and wildmeat access in highly forested areas of central Brazilian Amazonia. We surveyed 798 urban households in four towns and 311 rural households in 63 riverine communities. Rural–urban mobility was common amongst urban households: 49.7% maintained rural livelihoods and 57.3% were headed by rural in-migrants. Although many urban consumers purchased wildmeat, gifting was equally important. Urban households with greater rural–urban mobility consumed more wildmeat and were less likely to purchase it. Buying wildmeat was rare in rural areas but emergent in larger rural communities. Rural consumption was greater in remote areas, non-floodplain communities and during the high-water season. Urban populations placed particular pressure on three preferred species: the lowland paca Cuniculus paca, tapir Tapirus terrestris and white-lipped peccary Tayassu pecari. Rural consumption was more diverse, and per-capita wildmeat consumption was four times greater in rural than urban households (21 vs 5 kg/person/year). Total estimated annual wildmeat consumption was 3,732 t across 43 riverine urban centres compared to 11,351 t in surrounding rural areas. Because of poverty in these towns and socially mediated wildmeat acquisition, it is debatable whether urban consumers should or could be denied access to wildmeat. Nonetheless, the probable future increase in urban demand and related risks to sustainable, equitable resource use necessitate the monitoring and management of rural–urban wildmeat flows.

Global change poses challenges for remote Arctic Russian indigenous communities in the Republic of Sakha. On the basis of interviews from the village of Khara Tumul (Oymyakonskiy ulus) and city of Yakutsk, we illustrate the manners in which sharing networks may be used to enhance resilience in remote conditions as these communities confront climate change, industrial development and limited support from authorities. We identified the main carriers (givers and recipients), location, relationships and mediators, objects, and social and cultural meanings of sharing practices both in daily life and in the case of extreme events. The circulation of goods, money, information and people between cities and remote communities ultimately combines traditional values and modern technologies.

The question of how to engage with stakeholders in situations of value conflict to create value that includes a plurality of conflicting stakeholder value perspectives represents one of the crucial current challenges of stakeholder engagement as well as of value creation stakeholder theory. To address this challenge, we conceptualize a discursive sharing process between affected stakeholders that is oriented toward discursive justification involving multiple procedural steps. This sharing process provides procedural guidance for firms and stakeholders to create pluralistic stakeholder value through the discursive accommodation of diverging stakeholder value perspectives. The outcomes of such a discursive value-sharing process range from stakeholder value dissensus to low (agreement to disagree) and increasing levels of stakeholder value congruence (value compromise) to stakeholder value consensus (shared values). Hence, this article contributes to the emerging literature on integrative stakeholder engagement by conceptualizing a procedural framework that is neither overly oriented towards dissensus nor consensus.

According to Turnbull's 1972 ethnography The Mountain People, the Ik of Uganda had a culture of selfishness that made them uncooperative. His claims contrast with two widely accepted principles in evolutionary biology, that humans cooperate on larger scales than other species and that culture is an important facilitator of such cooperation. We use recently collected data to examine Ik culture and its influence on Ik behaviour. Turnbull's observations of selfishness were not necessarily inaccurate but they occurred during a severe famine. Cooperation re-emerged when people once again had enough resources to share. Accordingly, Ik donations in unframed Dictator Games are on par with average donations in Dictator Games played by people around the world. Furthermore, Ik culture includes traits that encourage sharing with those in need and a belief in supernatural punishment of selfishness. When these traits are used to frame Dictator Games, the average amounts given by Ik players increase. Turnbull's claim that the Ik have a culture of selfishness can be rejected. Cooperative norms are resilient, and the consensus among scholars that humans are remarkably cooperative and that human cooperation is supported by culture can remain intact.

Bastian, Jetten, and Ferris (2014) reported that shared pain enhances people’s bonding and cooperative behavior, but that shared no-pain has no such effect. They concluded that shared pain is a type of social glue that can improve people’s cooperation. However, in real life, both painful and painless experiences are often nonshared. Logically, the most direct way to determine whether sharing is the important element or not is to compare shared conditions with nonshared conditions. We conducted two experiments to investigate the relative effects of pain and sharing on enhancing people’s bonding and cooperative behavior by adding conditions of unshared pain and unshared no-pain. In experiment 1, we replicated Bastian, Jetten, and Ferris’s (2014) findings, and found that the effect of pain on bonding was mediated by empathy. In experiment 2, we used a 2 (pain/no-pain) × 2 (shared/unshared) design and found that while shared pain still induced more cooperative behavior than shared no-pain, unshared pain did not induce more cooperative behavior than unshared no-pain. Moreover, we found that empathy significantly mediated the relationship between pain and bonding when participants shared the experience. These results suggest that sharing is a necessary component for pain to act as social glue.

For three centuries the primary aspiration of Western governments has been constant economic growth but with the Industrial Revolution this objective became troublesome. In the 20th century unprecedented levels of industrial production and social consumption caused palpable harm to humans and the environment. Hannah Arendt and John Kenneth Galbraith turned their pens to such concerns and Bill Mollison and David Holmgren advocated a permaculture approach to growth, one that strives to limit human interference in natural growth processes. Today’s precarious economic and ecological imbalances could be stabilized by a shift in applied growth paradigms, from capitalist to permaculturist.

In this paper, we prove some value distribution results which lead to normality criteria for a family of meromorphic functions involving the sharing of a holomorphic function by more general differential polynomials generated by members of the family, and improve some recent results. In particular, the main result of this paper leads to a counterexample to the converse of Bloch’s principle.

In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently, the new domain ${\mathtt{ShLin}^{\omega}}$ has been introduced to generalize both sharing and linearity information. This domain is endowed with an optimal abstract operator for single-binding unification. The authors claim that the repeated application of this operator is also optimal for multibinding unification. This is the proof of such a claim.

Non-confluent and non-terminating {constructor-based term rewriting systems are useful for the purpose of specification and programming. In particular, existing functional logic languages use such kinds of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is a non-trivial issue, addressed years ago from a semantic point of view with the Constructor-based Rewriting Logic (CRWL), a well-known semantic framework commonly accepted as suitable semantic basis of modern functional logic languages. A drawback of CRWL is that it does not come with a proper notion of one-step reduction, which would be very useful to understand and reason about how computations proceed. In this paper, we develop thoroughly the theory for the first-order version of let-rewriting, a simple reduction notion close to that of classical term rewriting, but extended with a let-binding construction to adequately express the combination of call-time choice with non-strict semantics. Let-rewriting can be seen as a particular textual presentation of term graph rewriting. We investigate the properties of let-rewriting, most remarkably their equivalence with respect to a conservative extension of the CRWL-semantics coping with let-bindings, and we show by some case studies that having two interchangeable formal views (reduction/semantics) of the same language is a powerful reasoning tool. After that, we provide a notion of let-narrowing, which is adequate for call-time choice as proved by soundness and completeness results of let-narrowing with respect to let-rewriting. Moreover, we relate those let-rewriting and let-narrowing relations (and hence CRWL) with ordinary term rewriting and narrowing, providing in particular soundness and completeness of let-rewriting with respect to term rewriting for a class of programs which are deterministic in a semantic sense.

In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are correct but not optimal; i.e., they cannot fully exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domain ShLinω which can be thought of as a general framework from which other domains can be easily derived by abstraction. ShLinω makes the interaction between sharing and linearity explicit. We provide a constructive characterization of the optimal abstract unification operator on ShLinω, and we lift it to two well-known abstractions of ShLinω, namely, to the classical Sharing × Lin abstract domain and to the more precise ShLin2 abstract domain by Andy King. In the case of single-binding substitutions, we obtain optimal abstract unification algorithms for such domains.