Related papers: Canonical bidirectional typechecking

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Polarization of types in call-by-push-value naturally leads to the separation of inductively defined observable values (classified by positive types), and coinductively defined computations (classified by negative types), with adjoint…

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…

Let $G$ be a connected reductive algebraic group over an algebraically closed field of positive characteristic, $\mathfrak{g}$ be its Lie algebra, and $B$ be a Borel subgroup. We prove a formula for the dimensions of extension groups, in…

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Bidirectional typing is a discipline in which the typing judgment is decomposed explicitly into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be…

The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm is in charge of giving a meaning to the terms, types and proof…

The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…

Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…

We construct higher categories of iterated spans, possibly equipped with extra structure in the form of "local systems", and classify their fully dualizable objects. By the Cobordism Hypothesis, these give rise to framed topological quantum…

We use covariants of binary sextics to describe the structure of modules of scalar-valued or vector-valued Siegel modular forms of degree 2 with character, over the ring of scalar-valued Siegel modular forms of even weight. For a modular…

Let $H$ be a bialgebra. Let $\sigma: H\otimes H\to A$ be a linear map, where $A$ is a left $H$-comodule coalgebra, and an algebra with a left $H$-weak action $\triangleright$. Let $\tau: H\otimes H\to B$ be a linear map, where $B$ is a…

We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

We obtain a family of explicit "polyhedral" combinatorial expressions for multiplicities in the tensor product of two simple finite-dimensional modules over a complex semisimple Lie algebra. Here "polyhedral" means that the multiplicity in…

Let $C$ be a $k$-coalgebra, where $k$ is a field. The category of pseudocompact left $C^*$-modules is dual to both the category of discrete right $C^*$-modules and to the category of left $C$-comodules. We obtain this way two sides of a…

Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…

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…