Related papers: A Braided Lambda Calculus
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determ- ining provability of bounded depth formulas in the…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
For a class of non compact Riemannian manifolds with ends, we give pseudo-differential expansions of bounded functions of the semi-classical Laplacian and study related Lp boundedness properties.
We prove a coherence theorem for actions of groups on monoidal categories. As an application we prove coherence for arbitrary braided $G$-crossed categories.
This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more…
We review a braid theoretic self-linking number formula and study its applications.
Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…
Let k be a field. Let also (F, G) be a matched pair of groups. We give necessary and sufficient conditions on a pair (\sigma, \tau) of 2-cocycles in order that the crossed product algebra and the crossed coproduct coalgebra…
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
We present two rewriting systems that define labelled explicit substitution lambda-calculi. Our work is motivated by the close correspondence between Levy's labelled lambda-calculus and paths in proof-nets, which played an important role in…
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…
We present a Curry-style second-order type system with union and intersection types for the lambda-calculus with constructors of Arbiser, Miquel and Rios, an extension of lambda-calculus with a pattern matching mechanism for variadic…
We produce braided commutative algebras in braided monoidal categories by generalizing Davydov's full center construction of commutative algebras in centers of monoidal categories. Namely, we build braided commutative algebras in relative…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
In this paper we study the category of braided categorical Leibniz algebras and braided crossed modules of Leibniz algebras and we relate these structures with the categories of braided categorical Lie algebras and braided crossed modules…
In this paper, we give a natural braiding on the universal central extension of a crossed module of Lie algebras with a given braiding and construct the universal central extension of a braided crossed module of Lie algebras, showing that,…
This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda…
We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as…
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…