Related papers: From X to Pi; Representing the Classical Sequent C…
In this thesis I lift the Curry--Howard--Lambek correspondence between the simply-typed lambda calculus and cartesian closed categories to the bicategorical setting, then use the resulting type theory to prove a coherence result for…
The existence of an infinite set of conserved currents in completely integrable classical models, including chiral and Toda models as well as the KP and self-dual Yang-Mills equations, is traced back to a simple construction of an infinite…
We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in our…
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type…
In this paper we outline an approach to calculus over quasitriangular Hopf algebras. We study differential operators in the framework of monoidal categories equipped with a braiding or symmetry. To be more concrete, we choose as an example…
This paper presents the structure conversion by which from an Ann-category $\A,$ we can obtain its reduced Ann-category of the type $(R,M)$ whose structure is a family of five functions $k=(\xi,\eta,\alpha,\lambda,\rho)$. Then we will show…
A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from \fun\ to \uqg\ , given by elements of the pure braid group. These operators --- the `reflection matrix' $Y \equiv…
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the…
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…
The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum…
In a recent paper, Herbelin developed a calculus dPA$^\omega$ in which constructive proofs for the axioms of countable and dependent choices could be derived via the encoding of a proof of countable universal quantification as a stream of…
Let $A$ be a unital $C^*$-algebra. Its unitary group, $UA$, contains a wealth of topological information about $A$. However, the homotopy type of $UA$ is out of reach even for $A = M_2(\CC)$. There are two simplifications which have been…
The category of contexts underlying a model of Martin-L\"of type theory with Unit-, $\Sigma$-, and $\Pi$-types need not be locally Cartesian closed, but is necessarily a $\pi$-clan. We exploit this $\pi$-clan structure to build the theory…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
We prove that any geometrically connected curve $X$ over a field $k$ is an algebraic $K(\pi,1)$, as soon as its geometric irreducible components have nonzero genus. This means that the cohomology of any locally constant constructible…
We review the problem of finding a general framework within which one can construct quantum theories of non-standard models for space, or space-time. The starting point is the observation that entities of this type can typically be regarded…
A first order inference system, called R-calculus, is defined to develop the specifications. It is used to eliminate the laws which is not consistent with the user's requirements. The R-calculus consists of the structural rules, an axiom, a…
The calculus of constructions (CC) is a core theory for dependently typed programming and higher-order constructive logic. Originally introduced in Coquand's 1985 thesis, CC has inspired 25 years of research in programming languages and…
A new, comprehensive approach to inhabitation problems in simply-typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given…
We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau)$ be the set of countable structures with universe $\omega$ in vocabulary $\tau$ topologized by the Scott topology. We show that an invariant…