English
Related papers

Related papers: Intersection Types for Unboundedness Problems

200 papers

Products between phase-type distributed random variables and any independent, positive and continuous random variable are studied. Their asymptotic properties are established, and an expectation-maximization algorithm for their effective…

Probability · Mathematics 2021-11-25 Hansjoerg Albrecher , Martin Bladt , Mogens Bladt , Jorge Yslas

We formulate uncertainty relations for arbitrary finite number of incompatible observables. Based on the sum of variances of the observables, both Heisenberg-type and Schr\"{o}dinger-type uncertainty relations are provided. These new lower…

Quantum Physics · Physics 2016-08-23 Bin Chen , Ning-Ping Cao , Shao-Ming Fei , Gui-Lu Long

Splitting methods constitute a widely used class of numerical integrators for ordinary and partial differential equations, particularly well suited to problems that can be decomposed into simpler subproblems. High-order splitting schemes…

Numerical Analysis · Mathematics 2026-04-02 Fernando Casas , Ander Murua

This paper addresses the problem of a boundary control design for traffic evolving in a large-scale urban network. The traffic state is described on a macroscopic scale and corresponds to the vehicle density, whose dynamics are governed by…

Optimization and Control · Mathematics 2021-03-17 Liudmila Tumash , Carlos Canudas-de-Wit , Maria Laura Delle Monache

Multi types---aka non-idempotent intersection types---have been used to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of…

Programming Languages · Computer Science 2018-07-09 Beniamino Accattoli , Stéphane Graham-Lengrand , Delia Kesner

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…

Logic in Computer Science · Computer Science 2014-01-08 Alejandro Díaz-Caro , Giulio Manzonetto , Michele Pagani

We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of…

Logic in Computer Science · Computer Science 2017-01-11 Sylvain Salvati , Igor Walukiewicz

The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…

Information Theory · Computer Science 2016-02-03 Takahiro Ota , Akiko Manada , Hiroyoshi Morita

A simple algorithm for constructing an effective traffic model is presented. The algorithm uses statistically well-defined quantities extracted from the flow-density plot, and the resulting effective model naturally captures and predicts…

Adaptation and Self-Organizing Systems · Physics 2014-12-16 Bo Yang , Christopher Monterola

The structure of road networks plays a pivotal role in shaping transportation dynamics. It also provides insights into how drivers experience city streets and helps uncover each urban environment's unique characteristics and challenges.…

Social and Information Networks · Computer Science 2025-11-11 Anu Kuncheria , Joan L. Walker , Jane Macfarlane

Linear mixed-effects models are a central analytical tool for modeling hierarchical and longitudinal data, as they allow simultaneous representation of fixed and random sources of variation. In practice, inference for such models is most…

Methodology · Statistics 2026-02-12 Hilde Vinje , Lars Erik Gangsei

Transseries expansions build upon ordinary power series methods by including additional basis elements such as exponentials and logarithms. Alternative summation methods can then be used to "resum" series to obtain more efficient…

Dynamical Systems · Mathematics 2021-12-08 Inês Aniceto , Daniel Hasenbichler , Christopher J. Howls , Christopher J. Lustri

In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…

Programming Languages · Computer Science 2024-11-18 Giuseppe Castagna

We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…

Combinatorics · Mathematics 2020-01-07 Zdenek Dvorak , Rose McCarty , Sergey Norin

We consider an aggregation model for two interacting species. The coupling between the species is via their velocities, that incorporate self- and cross-interactions. Our main interest is categorizing the possible steady states of the…

Analysis of PDEs · Mathematics 2016-12-26 Joep H. M. Evers , Razvan C. Fetecau , Theodore Kolokolnikov

In the finite dimensional case, mean-type mappings, their invariant means, relations between the uniqueness of invariant means and convergence of orbits of the mapping, are considered. In particular it is shown, that the uniqueness of an…

Classical Analysis and ODEs · Mathematics 2022-06-10 Janusz Matkowski , Paweł Pasteczka

Let R be a commutative, noetherian, local ring. Topological Q-vector spaces modelled on full subcategories of the derived category of R are constructed in order to study intersection multiplicities.

Commutative Algebra · Mathematics 2007-05-23 Anders J. Frankild , Esben Bistrup Halvorsen

We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by…

Programming Languages · Computer Science 2015-11-10 C. -H. Luke Ong

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

Combinatorics · Mathematics 2007-05-23 M. Albert , M. D. Atkinson , N. Ruskuc

Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…

Programming Languages · Computer Science 2015-07-01 Delia Kesner