English
Related papers

Related papers: Dialectica Categories for the Lambek Calculus

200 papers

We introduce a unified elliptic extension of CL-type Clausen functions based on logarithmic primitives of the Jacobi theta function. The resulting elliptic Clausen family satisfies the same integral recursion as the classical circular case,…

General Mathematics · Mathematics 2026-02-13 Ken Nagai

We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…

Logic in Computer Science · Computer Science 2020-04-22 Federico Aschieri , Agata Ciabattoni , Francesco A. Genco

In recent years, the compositional distributional approach in computational linguistics has opened the way for an integration of the \emph{lexical} aspects of meaning into Lambek's type-logical grammar program. This approach is based on the…

Logic in Computer Science · Computer Science 2021-05-13 Giuseppe Greco , Fei Liang , Michael Moortgat , Alessandra Palmigiano , Apostolos Tzimoulis

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

Logic · Mathematics 2017-02-22 Will Boney

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We explore approximate categoricity in the context of distortion systems, introduced in our previous paper, which are a mild generalization of perturbation systems, introduced by Ben Yaacov. We extend Ben Yaacov's Ryll-Nardzewski style…

Logic · Mathematics 2020-11-03 James Hanson

In the framework of the probabilistic method in combinatorics, we revisit the entropy compression method clarifying the setting in which it can be applied and providing a theorem yielding a general constructive criterion. We finally…

Combinatorics · Mathematics 2019-12-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

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…

Logic in Computer Science · Computer Science 2012-10-12 Robbert Krebbers

We generalize to the relations $(\lambda, \mu) \stackrel{\kappa}{\Rightarrow} (\lambda', \mu')$ and $\alm (\lambda, \mu) \stackrel{\kappa}{\Rightarrow} \alm (\lambda', \mu')$ some results obtained in Parts II and IV. We also present a…

Logic · Mathematics 2009-03-30 Paolo Lipparini

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

Category Theory · Mathematics 2025-12-22 Thibaut Benjamin , Ioannis Markakis , Wilfred Offord , Chiara Sarti , Jamie Vicary

We give an exposition of the semantics of the simply-typed lambda-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for…

Logic in Computer Science · Computer Science 2024-05-06 Philip Saville

We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…

Logic · Mathematics 2009-05-05 Karim Nour

Probabilistic programming languages have recently gained a lot of attention, in particular due to their applications in domains such as machine learning and differential privacy. To establish invariants of interest, many such languages…

Programming Languages · Computer Science 2026-04-08 Wenjia Ye , Matías Toro , Federico Olmedo

This paper is about a categorical approach to model a very simple Semantically Linear lambda calculus, named Sll-calculus. This is a core calculus underlying the programming language SlPCF. In particular, in this work, we introduce the…

Logic in Computer Science · Computer Science 2010-03-30 Marco Gaboardi , Mauro Piccolo

The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…

Category Theory · Mathematics 2021-05-04 Ryu Hasegawa

The deformations of the Galilei algebra and their associated noncommutative Newtonian spacetimes are investigated. This is done by analyzing the possible nonrelativistic limits of an eleven generator (pseudo)extended \kap-Poincar\'e algebra…

q-alg · Mathematics 2011-07-28 J. A. de Azcarraga , J. C. Perez Bueno

Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…

Logic in Computer Science · Computer Science 2021-04-28 Paolo Pistone

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by J\"ager and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for…

Logic · Mathematics 2026-05-04 Lukas Zenger