相关论文: Infinitary Intersection Types as Sequences: a New …

We first give a relative flexible process to construct torsion cohomology classes for Shimura varieties of Kottwitz-Harris-Taylor type with coefficient in a non too regular local system. We then prove that associated to each torsion…

In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…

We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been…

Given a finite dimensional algebra $\Lambda$, we show that a frequently satisfied finiteness condition for the category ${\cal P}^{\infty}(\Lambda\rm{-mod})$ of all finitely generated (left) $\Lambda$-modules of finite projective dimension,…

It was shown in a previous work of the first named author with De Chiffre, Glebsky and Thom that there exists a finitely presented group which cannot be approximated by almost-homomorphisms to the unitary groups $U(n)$ equipped with the…

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

The theory of finite and infinitary term rewriting is extensively developed for orthogonal rewrite systems, but to a lesser degree for weakly orthogonal rewrite systems. In this note we present some contributions to the latter case of weak…

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

New types of stationary solutions of a one-dimensional driven sixth-order Cahn-Hilliard type equation that arises as a model for epitaxially growing nano-structures such as quantum dots, are derived by an extension of the method of matched…

We study an assignment system of intersection types for a lambda-calculus with records and a record-merge operator, where types are preserved both under subject reduction and expansion. The calculus is expressive enough to naturally…

We use Hensel minimality, a non-Archimedean analog of o-minimality, to study several questions around transcendental number theory, unlikely intersections, and differential fields in a non-Archimedean setting. In particular, we focus on…

We solve the Stechkin problem about approximation of generally speaking unbounded hypersingular integral operators by bounded ones. As a part of the proof, we also solve several related and interesting on their own problems. In particular,…

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…

Bernardy et al. [2018] proposed a linear type system $\lambda^q_\to$ as a core type system of Linear Haskell. In the system, linearity is represented by annotated arrow types $A \to_m B$, where $m$ denotes the multiplicity of the argument.…

We introduce a method for associating a chain complex to a module over a combinatorial category, such that if the complex is exact then the module has a rational Hilbert series. We prove homology--vanishing theorems for these complexes for…

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 prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

We introduce a new type of equivalence between blocks of finite group algebras called a strong isotypy. A strong isotypy is equivalent to a $p$-permutation equivalence and restricts to an isotypy in the sense of Brou\'{e}. To prove these…

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…

Understanding extreme non-locality in many-body quantum systems can help resolve questions in thermostatistics and laser physics. The existence of symmetry selection rules for Hamiltonians with non-decaying terms on infinite-size lattices…