Related papers: Intersection Types for Unboundedness Problems
In this tutorial I will present how a combination of linear and dependent type can be useful to describe different properties about higher order programs. Linear types have been proved particularly useful to express properties of functions;…
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial…
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…
In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Methods of determination of constants of the Standard Model are considered. The constants values obtained now are presented and experiments for improving some values are pointed out. A few possible generalized models are considered together…
The "finite intersection property" for bifunctions is introduced and its relationship with generalized monotonicity properties is studied. Some results concerning existence of solution for (quasi-)equilibrium problems are established and…
We find explicit formulas for the Hilbert series of residual intersections of a scheme in terms of the Hilbert series of its conormal modules. In a previous paper we proved that such formulas should exist. We give applications to the…
Type systems hide data that is captured by function closures in function types. In most cases this is a beneficial design that favors simplicity and compositionality. However, some applications require explicit information about the data…
Multilevel or hierarchical data structures can occur in many areas of research, including economics, psychology, sociology, agriculture, medicine, and public health. Over the last 25 years, there has been increasing interest in developing…
The purpose of this talk is to present an (apparently) new way to look at the intersection complex of a singular variety over a finite field, or, more generally, at the intermediate extension functor on pure perverse sheaves, and an…
When describing images, humans tend not to talk about the obvious, but rather mention what they find interesting. We argue that abnormalities and deviations from typicalities are among the most important components that form what is worth…
A long-standing shortcoming of statically typed functional languages is that type checking does not rule out pattern-matching failures (run-time match exceptions). Refinement types distinguish different values of datatypes; if a program…
Despite a growing body of work at the intersection of deep learning and formal languages, there has been relatively little systematic exploration of transformer models for reasoning about typed lambda calculi. This is an interesting area of…
We study the properties, in particular termination, of dependent types systems for lambda calculus and rewriting.
We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
This article presents a novel approach to identifying and classifying intersections for semantic and topological mapping. More specifically, the proposed novel approach has the merit of generating a semantically meaningful map containing…
We present an approach for modeling the Semantic Web as a type system. By using a type system, we can use symbolic representation for representing linked data. Objects with only data properties and references to external resources are…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…