Related papers: A Braided Lambda Calculus
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…
The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.
We construct a braided analogue of the quantum permutation group and show that it is the universal braided compact quantum group acting on a finite space in the category of $\mathbb{Z}/N\mathbb{Z}$-$\textrm{C}^*$-algebras with a twisted…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
We introduce the concept of braided left-symmetric bialgebras and construct cocycle bicrossproduct left-symmetric bialgebras. As an application, we solve the extending problem for left-symmetric bialgebras by using some non-abelian…
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
We give a formula of the colored Alexander invariant in terms of the homological representation of the braid groups which we call truncated Lawrence's representation. This formula generalizes the famous Burau representation formula of the…
Linear typed $\lambda$-calculi are more delicate than their simply typed siblings when it comes to metatheoretic results like preservation of typing under renaming and substitution. Tracking the usage of variables in contexts places more…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
Let G be a finite group and let S be a G-set. The Burnside ring of G has a natural structure of a lambda-ring. However, a priori the images of S under the lambda-operations can only be computed implicitly. In this paper we establish an…
A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…
We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a…
With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from…
We characterize unitary representations of braid groups $B_n$ of degree linear in $n$ and finite images of such representations of degree exponential in $n$.
We revisit the Vectorial Lambda Calculus, a typed version of Lineal. Vectorial (as well as Lineal) has been originally designed for quantum computing, as an extension to System F where linear combinations of lambda terms are also terms and…