Zobrazeno 1 - 10
of 2 666
pro vyhledávání: '"Vanoni A"'
Contextual equivalence is the de facto standard notion of program equivalence. A key theorem is that contextual equivalence is an equational theory. Making contextual equivalence more intensional, for example taking into account the time cost of the
Externí odkaz:
http://arxiv.org/abs/2409.18709
Autor:
Altshuler, Boris L., Kravtsov, Vladimir E., Scardicchio, Antonello, Sierant, Piotr, Vanoni, Carlo
We discuss the dependence of the critical properties of the Anderson model on the dimension $d$ in the language of $\beta$-function and renormalization group recently introduced in Ref.[arXiv:2306.14965] in the context of Anderson transition on rando
Externí odkaz:
http://arxiv.org/abs/2403.01974
Autor:
Kutlin, Anton, Vanoni, Carlo
Resonance counting is an intuitive and widely used tool in Random Matrix Theory and Anderson Localization. Its undoubted advantage is its simplicity: in principle, it is easily applicable to any random matrix ensemble. On the downside, the notion of
Externí odkaz:
http://arxiv.org/abs/2402.10271
We investigate the tree-to-tree functions computed by \enquote{affine$\lambda$-transducers}: tree automata whose memory consists of an affine $\lambda$-term instead of a finite state. They can be seen as variations on Gallot, Lemay and Salvati's Line
Externí odkaz:
http://arxiv.org/abs/2402.05854
We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational semantics, b
Externí odkaz:
http://arxiv.org/abs/2401.12744
Autor:
Vanoni, Carlo, Vitale, Vittorio
We propose a new viewpoint on the study of localization transitions in disordered quantum systems, showing how critical properties can be seen also as a geometric transition in the data space generated by the classically encoded configurations of the
Externí odkaz:
http://arxiv.org/abs/2311.16050
Publikováno v:
Proc. ACM Program. Lang. 8, POPL, Article 84 (January 2024)
Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inference, both exact and approximate. We introduce a \emph{higher-order} prog
Externí odkaz:
http://arxiv.org/abs/2311.04651
We present a renormalization group analysis of the problem of Anderson localization on a Random Regular Graph (RRG) which generalizes the renormalization group of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional graphs. The
Externí odkaz:
http://arxiv.org/abs/2306.14965
When a free Fermi gas on a lattice is subject to the action of a linear potential it does not drift away, as one would naively expect, but it remains spatially localized. Here we revisit this phenomenon, known as Stark localization, within the recent
Externí odkaz:
http://arxiv.org/abs/2303.14059
This note modifies the reference encoding of Turing machines in the $\lambda$-calculus by Dal Lago and Accattoli, which is tuned for time efficiency, as to accommodate logarithmic space. There are two main changes: Turing machines now have *two* tape
Externí odkaz:
http://arxiv.org/abs/2301.12556