Related papers: Reduction in X does not agree with Intersection an…
In this article we determine the coefficient bounds for functions in certain subclasses of analytic functions defined by subordination which are related to the well-known classes of starlike and convex functions. The main results deal with…
Type checking algorithms and theorem provers rely on unification algorithms. In presence of type families or higher-order logic, higher-order (pre)unification (HOU) is required. Many HOU algorithms are expressed in terms of…
We introduce a graphical refutation calculus for relational inclusions: it reduces establishing a relational inclusion to establishing that a graph constructed from it has empty extension. This sound and complete calculus is conceptually…
Within the framework of quantum contextuality, we discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems. We emphasize that whereas Kochen-Specker's is essentially a no-go…
Context-free session types describe structured patterns of communication on heterogeneously-typed channels, allowing the specification of protocols unconstrained by tail recursion. The enhanced expressive power provided by non-regular…
We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of…
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places, some formulations and proofs are here corrected, and…
Real world programming languages crucially depend on the availability of computational effects to achieve programming convenience and expressive power as well as program efficiency. Logical frameworks rely on predicates, or dependent types,…
The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage…
In this paper, we prove Hurwitz-Eichler type formulas for Hurwitz class numbers with each level $ M $ when the modular curve $ X_0(M) $ has genus zero. A key idea is to calculate intersection numbers of modular correspondences with the…
Relational semantics for linear logic is a form of non-idempotent intersection type system, from which several informations on the execution of a proof-structure can be recovered. An element of the relational interpretation of a…
We introduce the notion of {\it approximation type} for the partial, and in certain cases the total description of extensions of a given valuation from a field $K$ to the rational function field $K(x)$. To every extension, a unique…
The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…
Session types model structured communication-based programming. In particular, binary session types for the pi-calculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the pi-calculus…
We present a sequent calculus for first-order logic with lambda terms and definite descriptions. The theory formalised by this calculus is essentially Russellian, but avoids some of its well known drawbacks and treats definite description…
In this paper we introduce a typed, concurrent $\lambda$-calculus with references featuring explicit substitutions for variables and references. Alongside usual safety properties, we recover strong normalization. The proof is based on a…
We define cut-and-join operator in Hurwitz theory for merging of two branching points of arbitrary type. These operators have two alternative descriptions:(i) they have the GL characters as eigenfunctions and the symmetric-group characters…
In this article we construct a categorical resolution of singularities of an excellent reduced curve $X$, introducing a certain sheaf of orders on $X$. This categorical resolution is shown to be a recollement of the derived category of…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
In this work we introduce notions in Auslander-Buchweitz theory and cotorsion theory in extriangulated categories which extend the given ones for abelian categories. Although these notions have been already developed for extriangulated…