Related papers: Path Types in Algebraic Type Theory
One of the most popular methods of the machine learning prediction explanation is the SHapley Additive exPlanations method (SHAP). An imprecise SHAP as a modification of the original SHAP is proposed for cases when the class probability…
Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation,…
In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…
The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…
We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output…
The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…
Inhomogeneous phase-type (IPH) distributions extend classical phase-type models by allowing transition intensities to vary over time, offering greater flexibility for modeling heavy-tailed or time-dependent absorption phenomena. We focus on…
We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…
A new behavior descriptive entity type called spec is proposed, which combines the traditional interface with test rules and test cases, to completely specify the desired behavior of each method, and to enforce the behavior-wise correctness…
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
It is known that the ideals of a Leavitt path algebra $L_K(E)$ generated by $\Pl(E)$, by $\Pc(E)$ or by $\Pec(E)$ are invariant under isomorphism. Though the ideal generated by $\Pb(E)$ is not invariant we find its \lq\lq natural\rq\rq\…
We study finite-dimensional integrals in a way that elucidates the mathematical meaning behind the formal manipulations of path integrals occurring in quantum field theory. This involves a proper understanding of how Wick's theorem allows…
A new algebraic treatment of dependent type theory is proposed using ideas derived from topos theory and algebraic set theory.
The use of a necessity modality in a typed $\lambda$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and…
We introduce an intersection type system for the lambda-mu calculus that is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus's denotational model of continuations in the category of…
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…
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…
In recent years, the Graph Model has become increasingly popular, especially in the application domain of social networks. The model has been semantically augmented with properties and labels attached to the graph elements. It is difficult…
We first consider interval partitions whose complements are Lebesgue-null and introduce a complete metric that induces the same topology as the Hausdorff distance (between complements). This is done using correspondences between intervals.…
An interval translation map (ITM) is a map $T \colon I \to I$ defined as a piecewise translation on a finite partition of an interval $I$ into $r \ge 2$ subintervals. Unlike classical interval exchange transformations (IETs), the images of…