Related papers: Superdevelopments for Weak Reduction
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…
In this paper we study subalgebras of complex finite dimensional evolution algebras. We obtain the classification of nilpotent evolution algebras whose any subalgebra is an evolution subalgebra with a basis which can be extended to a…
Let A be a domain of the boundary of a strictly pseudoconvex domain \Omega of C^n and M a smooth, closed, maximally complex submanifold of A. We find a subdomain \widetilde A of \Omega, depending only on \Omega and A, and a complex…
This paper aims to describe the restricted Kac modules of restricted Hamiltonian Lie superalgebras of odd type over an algebraically closed field of characteristic $p>3$. In particular, a sufficient and necessary condition for the…
Undersampled inverse problems occur everywhere in the sciences including medical imaging, radar, astronomy etc., yielding underdetermined linear or non-linear reconstruction problems. There are now a myriad of techniques to design decoders…
To support the understanding of declarative probabilistic programming languages, we introduce a lambda-calculus with a fair binary probabilistic choice that chooses between its arguments with equal probability. The reduction strategy of the…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine? Is there a way to measure the computational complexity…
We present a weakly supervised deep learning method to perform instance segmentation of cells present in microscopy images. Annotation of biomedical images in the lab can be scarce, incomplete, and inaccurate. This is of concern when…
We describe a new method to obtain weak subconvexity bounds for $L$-functions with mild hypotheses on the size of the Dirichlet coefficients. We verify these hypotheses for all automorphic $L$-functions and (with mild restrictions) the…
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…
We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal {\epsilon}-subdifferentials, by incorporating the moduli of weak convexity of the functions into the respective formulas.…
We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock $\beta$-redexes without resorting to the standard permutative conversions of generalized…
Delimited control operator shift0 exhibits versatile capabilities: it can express layered monadic effects, or equivalently, algebraic effects. Little did we know it can express lambda calculus too! We present $ \Lambda_\$ $, a call-by-value…
We propose an implementation of lambda+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. The rewrite system of lambda+ is a rewrite system modulo an equivalence relation, which makes its…
Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…
Distributed matrix computations -- matrix-matrix or matrix-vector multiplications -- are well-recognized to suffer from the problem of stragglers (slow or failed worker nodes). Much of prior work in this area is (i) either sub-optimal in…
Degenerate modules of the exceptional infinite-dimensional simple Lie superalgebras vle(3|6), ksle(5|10) and mb(3|8) have recently been constructed by Kac and Rudakov, and by Grozman, Leites and Shchepochkina. I rederive their results using…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
We extend the duality principle for the $\Gamma$-convergence of convex lower semicontinuous functions, which was previously established only in separable reflexive Banach spaces, to the broader class of weakly compactly generated (WCG)…