Related papers: The excess formula in functorial form
Refinement types -- types qualified with logical predicates -- have proven effective for lightweight verification in languages like Liquid Haskell, F*, and Dafny. However, in these systems refinements are either written in a separate…
We study a new class of functions that arise naturally in quaternionic analysis, we call them "quasi regular functions". Like the well-known quaternionic regular functions, these functions provide representations of the quaternionic…
There is a problem with the foundations of classical mathematics, and potentially even with the foundations of computer science, that mathematicians have by-and-large ignored. This essay is a call for practicing mathematicians who have been…
We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.
We revisit and generalize our previous algebraic construction of the chiral effective action for Conformal Field Theory on higher genus Riemann surfaces. We show that the action functional can be obtained by evaluating a certain Deligne…
Ramification invariants are necessary, but not in general sufficient, to determine the Galois module structure of ideals in local number field extensions. This insufficiency is associated with elementary abelian extensions, where one can…
We prove that extension groups in strict polynomial functor categories compute the rational cohomology of classical algebraic groups. This result was previously known only for general linear groups. We give several applications to the study…
This paper continues the program that was initiated in \cite{Dav18} and continued in \cite{DSVG24}, where a high-dimensional limiting technique was developed and used to prove certain parabolic theorems from their elliptic counterparts. The…
This paper addresses the problem of describing aperiodic discrete structures that have a self-similar or self-affine structure. Substitution Delone set families are families of Delone sets (X_1, ..., X_n) in R^d that satisfy an inflation…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
We introduce Refinement Reflection, a new framework for building SMT-based deductive verifiers. The key idea is to reflect the code implementing a user-defined function into the function's (output) refinement type. As a consequence, at uses…
We develop a new setting for the exponential principle in the context of multisort species, where indecomposable objects are generated intrinsically instead of being given in advance. Our approach uses the language of functors and natural…
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,…
The classical Rellich inequalities imply that the $L^2$-norms of the normal and tangential derivatives of a harmonic function are equivalent. In this note, we prove several refined inequalities, which make sense even if the domain is not…
The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…
We make the interprecision transfers explicit in an algorithmic description of iterative refinement and obtain new insights into the algorithm. One example is the classic variant of iterative refinement where the matrix and the…
Fractional variation is defined as the limit of the difference quotient of the increments of a function and its argument raised to a fractional power. Fractional velocity can be suitable for characterizing singular behavior of derivatives…
The purpose of this paper is to introduce and study a q-analogue of the holonomic system of differential equations associated to the Belavin's classical r-matrix (elliptic r-matrix equations), or, equivalently, to define an elliptic…
We derive the discrete version of the classical Helmholtz condition. Precisely, we state a theorem characterizing second order finite differences equations admitting a Lagrangian formulation. Moreover, in the affirmative case, we provide…
A refinement of the multinomial distribution is presented where the number of inversions in the sequence of outcomes is tallied. This refinement of the multinomial distribution is its joint distribution with the number of inversions in the…