Related papers: Transitivity of Subtyping for Intersection Types
Subatomic systems were recently introduced to identify the structural principles underpinning the normalization of proofs. "Subatomic" means that we can reformulate logical systems in accordance with two principles. Their atomic formulas…
This paper investigates the competition between both simple (e.g. stripes, hexagons) and ``superlattice'' (super squares, super hexagons) Turing patterns in two-component reaction-diffusion systems. ``Superlattice'' patterns are formed from…
Session types employ a linear type system that ensures that communication channels cannot be implicitly copied or discarded. As a result, many mechanizations of these systems require modeling channel contexts and carefully ensuring that…
Luo et al. proposed a new method to design the maximally permissive and efficient supervisor for enforcing linear constraints on an ordinary Petri net with uncontrollable transitions. In order to develop this method, Theorem 3 is given. It…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground lambda-term corresponds to some property of…
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…
Session types statically prescribe bidirectional communication protocols for message-passing processes. However, simple session types cannot specify properties beyond the type of exchanged messages. In this paper we extend the type system…
We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…
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…
The restoration lemma is a classic result by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [PODC '01], which relates the structure of shortest paths in a graph $G$ before and after some edges in the graph fail. Their work shows that, after…
A design methodology and synthesis equations are described for lumped-element filter prototypes having low-pass, high-pass, band-pass, or band-stop characteristics with theoretically perfect input- and output-match at all frequencies. Such…
We present sufficient conditions for the transience and the existence of local times of a Feller process, and the ultracontractivity of the associated Feller semigroup; these conditions are sharp for L\'{e}vy processes. The proof uses a…
A linear parameter must be consumed exactly once in the body of its function. When declaring resources such as file handles and manually managed memory as linear arguments, a linear type system can verify that these resources are used…
We introduce a weaker form of the specification property, called "one-way specification property", and give several examples of non-transitive systems satisfying this property. As an application, we show that the $(-\beta)$-transformation…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…
In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…
An idea that became unavoidable to study zero entropy symbolic dynamics is that the dynamical properties of a system induce in it a combinatorial structure. An old problem addressing this intuition is finding a structure theorem for…
New asymptotic models are formulated to capture the thermal transfer across falling films. These models enable to simulate a wide range of Biot and Peclet number values, without displaying nonphysical behaviors. The models correctly capture…