Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Representation Theorem for Second-Order Functionals
539
0
0.0
(
0
)
Added by
Mauro Jaskelioff
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of second-order functionals which are polymorphic over a class of functors. Types polymorphic over a class of functors are easily representable in languages such as Haskell, but are difficult to analyse and reason about. The concrete representation provided by the theorem is easier to analyse, but it might not be as convenient to implement. Therefore, depending on the task at hand, the change of representation may prove valuable in one direction or the other. We showcase the usefulness of the representation theorem with a range of examples. Concretely, we show how the representation theorem can be used to show that traversable functors are finitary containers, how parameterised coalgebras relate to very well-behaved lenses, and how algebraic effects might be implemented in a functional language.
rate research
Read More
Given a vector $F=(F_1,dots,F_m)$ of Poisson functionals $F_1,dots,F_m$, we investigate the proximity between $F$ and an $m$-dimensional centered Gaussian random vector $N_Sigma$ with covariance matrix $Sigmainmathbb{R}^{mtimes m}$. Apart from finding proximity bounds for the $d_2$- and $d_3$-distances, based on classes of smooth test functions, we obtain proximity bounds for the $d_{convex}$-distance, based on the less tractable test functions comprised of indicators of convex sets. The bounds for all three distances are shown to be of the same order, which is presumably optimal. The bounds are multivariate counterparts of the univariate second order Poincare inequalities and, as such, are expressed in terms of integrated moments of first and second order difference operators. The derived second order Poincare inequalities for indicators of convex sets are made possible by a new bound on the second derivatives of the solution to the Stein equation for the multivariate normal distribution. We present applications to the multivariate normal approximation of first order Poisson integrals and of statistics of Boolean models.
In this paper we study some classes of second order non-homogeneous nonlinear differential equations allowing a specific representation for nonlinear Greens function. In particular, we show that if the nonlinear term possesses a special multiplicativity property, then its Greens function is represented as the product of the Heaviside function and the general solution of the corresponding homogeneous equations subject to non-homogeneous Cauchy conditions. Hierarchies of specific non-linearities admitting this representation are derived. The nonlinear Greens function solution is numerically justified for the sinh-Gordon and Liouville equations. We also list two open problems leading to a more thorough characterizations of non-linearities admitting the obtained representation for the nonlinear Greens function.
RacerD is a static race detector that has been proven to be effective in engineering practice: it has seen thousands of data races fixed by developers before reaching production, and has supported the migration of Facebooks Android app rendering infrastructure from a single-threaded to a multi-threaded architecture. We prove a True Positives Theorem stating that, under certain assumptions, an idealized theoretical version of the analysis never reports a false positive. We also provide an empirical evaluation of an implementation of this analysis, versus the original RacerD. The theorem was motivated in the first case by the desire to understand the observation from production that RacerD was providing remarkably accurate signal to developers, and then the theorem guided further analyzer design decisions. Technically, our result can be seen as saying that the analysis computes an under-approximation of an over-approximation, which is the reverse of the more usual (over of under) situation in static analysis. Until now, static analyzers that are effective in practice but unsound have often been regarded as ad hoc; in contrast, we suggest that, in the future, theorems of this variety might be generally useful in understanding, justifying and designing effective static analyses for bug catching.
A framework is presented for including second-order perturbative corrections to the radiation patterns of parton showers. The formalism allows to combine O(alphaS^2)-corrected iterated 2->3 kernels for ordered gluon emissions with tree-level 2->4 kernels for unordered ones. The combined Sudakov evolution kernel is thus accurate to O(alphaS^2). As a first step towards a full-fledged implementation of these ideas, we develop an explicit implementation of 2->4 shower branchings in this letter.
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into coupled second order equations. Our main motivation is to treat certain fourth order surface equations arising in the modelling of biomembranes but the approach may be applied more generally. In particular, we are interested in equations with non-smooth right hand sides and operators which have non-trivial kernels.The theory for well posedness and approximation is presented in an abstract setting. Several examples are described together with some numerical experiments.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
