Related papers: Superdevelopments for Weak Reduction
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…
We introduce weak exceptional sequence of modules which can be viewed as another modification of the standard case, different than the works of Igusa-Todorov \cite{Igusa-Todorov} and Buan-Marsh \cite{Buan-Marsh}. For hereditary algebras it…
In this paper, we introduce and study the class of {\it enriched strictly pseudocontractive mappings} in Hilbert spaces and extend the corresponding convergence theorem (Theorem 12) in [Browder, F. E., Petryshyn, W. V., {\it Construction of…
The aim of this paper is to investigate weakly developable spaces. For a comparison with semi-metrizable spaces, we introduce and study a class of spaces among those of weakly developable spaces, semimetrizable spaces and first countable…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…
Let $H$ be a Hilbert space. We investigate the properties of weak limit points of iterates of random projections onto $K\geq 2$ closed convex sets in $H$ and the parallel properties of weak limit points of residuals of random greedy…
This paper presents a self-contained new theory of weak fractional differential calculus in one-dimension. The crux of this new theory is the introduction of a weak fractional derivative notion which is a natural generalization of integer…
Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a…
We study weak geodesics in the space of potentials for the deformed Hermitian-Yang-Mills equation. The geodesic equation can be formulated as a degenerate elliptic equation, allowing us to employ nonlinear Dirichlet duality theory, as…
This paper presents two new techniques relating to inexact solution of subproblems in augmented Lagrangian methods for convex programming. The first involves combining a relative error criterion for solution of the subproblems with over- or…
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment system for a calculus endowed with copy constructors, which…
This paper is the second in a series of works on weak convergence of one-step schemes for solving stochastic differential equations (SDEs) with one-sided Lipschitz conditions. It is known that the super-linear coefficients may lead to a…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
The theory of finite and infinitary term rewriting is extensively developed for orthogonal rewrite systems, but to a lesser degree for weakly orthogonal rewrite systems. In this note we present some contributions to the latter case of weak…
The calculus of finite differences is a solid foundation for the development of operations such as the derivative and the integral for infinite sequences. Here we showed a way to extend it for finite sequences. We could then define…
The aim of this paper is to prove existence of weak solutions of hyperbolic-parabolic evolution inclusions defined on Lipschitz domains with mixed boundary conditions describing, for instance, damage processes and elasticity with inertia…
This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…