A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every function and parameterizing the semantics by this choice we abstract from the parameterpassing mechanism. Thus common and distinguishing features of a...

We incorporate externalities into the stable matching theory of two-sided markets: We establish the existence of stable matchings provided that externalities are positive and agents’ choices satisfy substitutability, and we show that the standard insights of matching theory, such as the existence of side optimal stable matchings and the rural hospitals theorem, remain valid despite the presence...

Entanglement is a digraph complexity measure that origins in fixedpoint theory. Its purpose is to count the nested depth of cycles in digraphs. In this paper we prove that the class of undirected graphs of entanglement at most k, for arbitrary fixed k ∈ N, is closed under taking minors. Our proof relies on the game theoretic characterization of entanglement in terms of Robber and Cops games.

Abstract In this paper, we study the resonance problem of a class of singular quasilinear parabolic equations with respect to its higher near-eigenvalues. Under a generalized Landesman-Lazer condition, it is proved that the resonance problem admits at least one nontrivial solution in weighted Sobolev spaces. The proof is based upon applying the Galerkin-type technique, the Brouwer’s fixedpoint ...

The relative Lefschetz and Nielsen fixed-point theorems are generalized for compact absorbing contractions on ANR-spaces and nilmanifolds. The nontrivial Lefschetz number implies the existence of a fixedpoint in the closure of the complementary domain. The relative Nielsen numbers improve the lower estimate of the number of coincidences on the total space or indicate the location of fixed-point...

This paper presents two techniques for the design of digital filters with bit-constrained coefficients, the “bit-flipping” algorithm [1] and the Downhill Simplex Method modified to deliver fixedpoint filter coefficients [2]. Both techniques can be applied both to design filters from scratch and to optimise their floating-point equivalents. They are comparatively presented through an example of ...

‎the purpose of this paper is to establish some coupled coincidence point theorems for mappings having a mixed $g$-monotone property in partially ordered metric spaces‎. ‎also‎, ‎we present a result on the existence and uniqueness of coupled common fixed points‎. ‎the results presented in the paper generalize and extend several well-known results in the literature‎.

In the present paper‎, ‎we show the existence of a coupled fixed point for a non-decreasing mapping in partially ordered complete metric space using a partial order induced by an appropriate function $phi$‎. ‎We also define the concept of weakly related mappings on an ordered space‎. ‎Moreover common coupled fixed points for two and three weakly related mappings are also proved in the same space‎.