Related papers: A Braided Lambda Calculus
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
The conventional topological description given by the fundamental group of nematic order parameter does not adequately explain the entangled defect line structures that have been observed in nematic colloids. We introduce a new topological…
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
Many theories of semantic interpretation use lambda-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate lambda-term operations with…
This paper concerns the explicit treatment of substitutions in the lambda calculus. One of its contributions is the simplification and rationalization of the suspension calculus that embodies such a treatment. The earlier version of this…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
A representation of the central extension of the unitary Lie algebra coordinated with a skew Laurent polynomial ring is constructed using vertex operators over an integral Z_2-lattice. The irreducible decomposition of the representation is…
The main aim of the article is to give a simple and conceptual account for the correspondence (originally described by Bodini, Gardy, and Jacquot) between $\alpha$-equivalence classes of closed linear lambda terms and isomorphism classes of…
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
In this note, we adapt the procedure of the Long-Moody procedure to construct linear representations of welded braid groups. We exhibit the natural setting in this context and compute the first examples of representations we obtain thanks…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
General braided counterparts of classical Clifford algebras are introduced and investigated. Braided Clifford algebras are defined as Chevalley-Kahler deformations of the corresponding braided exterior algebras. Analogs of the spinor…
We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…
We give a pedagogical introduction to integration techniques appropriate for non-commutative spaces while presenting some new results as well. A rather detailed discussion outlines the motivation for adopting the Hopf algebra language. We…
We propose Weighted Guarded Kleene Algebra with Tests (wGKAT), an uninterpreted weighted programming language equipped with branching, conditionals, and loops. We provide an operational semantics for wGKAT using a variant of weighted…
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and…
The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…