English
Related papers

Related papers: A General Probabilistic Framework in IMALL: A Conc…

200 papers

We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We…

Logic in Computer Science · Computer Science 2026-04-03 Alejandro Díaz-Caro , Octavio Malherbe

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit

Traditional approaches to modelling parallelism and algebraic structure in lambda calculi often rely on monads$\unicode{x2013}$as in Moggi's framework$\unicode{x2013}$or on rich categorical structures such as biproducts$\unicode{x2013}$as…

Logic in Computer Science · Computer Science 2025-12-22 Alejandro Díaz-Caro , Octavio Malherbe

We give an adequate, concrete, categorical-based model for Lambda-S, which is a typed version of a linear-algebraic lambda calculus, extended with measurements. Lambda-S is an extension to first-order lambda calculus unifying two approaches…

Logic in Computer Science · Computer Science 2024-06-18 Alejandro Díaz-Caro , Octavio Malherbe

We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…

Logic in Computer Science · Computer Science 2022-04-11 Tom Hirschowitz , Ambroise Lafont

We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…

Logic in Computer Science · Computer Science 2020-02-10 Ugo de'Liguoro , Riccardo Treglia

By building on the notions of internal projective and injective objects in a module category introduced by Douglas, Schommer-Pries, and Snyder, we extend the reconstruction theory for module categories of Etingof and Ostrik. More…

Quantum Algebra · Mathematics 2024-11-28 Mateusz Stroiński , Tony Zorman

We introduce a proof language for Intuitionistic Multiplicative Additive Linear Logic (IMALL), extended with a modality B to capture mixed-state quantum computation. The language supports algebraic constructs such as linear combinations,…

Logic in Computer Science · Computer Science 2025-12-22 Kinnari Dave , Alejandro Díaz-Caro , Vladimir Zamdzhiev

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

Logic in Computer Science · Computer Science 2015-07-01 Hyvernat Pierre

This thesis develops the categorical proof theory for the non-compact multiplicative dagger linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The existing frameworks of CQM are categorical proof…

Category Theory · Mathematics 2023-03-28 Priyaa Varshinee Srinivasan

We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…

Logic in Computer Science · Computer Science 2019-02-20 Pierre Hyvernat

Using Dugger's construction of universal model categories, we produce replacements for simplicial and combinatorial symmetric monoidal model categories with better operadic properties. Namely, these replacements admit a model structure on…

Algebraic Topology · Mathematics 2024-12-31 Haldun Özgür Bayındır , Boris Chorny

We introduce a category of noncommutative bundles. To establish geometry in this category we construct suitable noncommutative differential calculi on these bundles and study their basic properties. Furthermore we define the notion of a…

q-alg · Mathematics 2008-02-03 Markus J. Pflaum , Peter Schauenburg

We present a novel lambda calculus that casts the categorical approach to the study of quantum protocols into the rich and well established tradition of type theory. Our construction extends the linear typed lambda calculus with a linear…

Logic in Computer Science · Computer Science 2014-12-31 Philip Atzemoglou

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…

Logic in Computer Science · Computer Science 2019-07-23 Pablo Barenbaum , Gonzalo Ciruelos

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Logic in Computer Science · Computer Science 2024-01-30 C. B. Aberlé

The purpose of this paper is to build a new bridge between category theory and a generalized probability theory known as noncommutative probability or quantum probability, which was originated as a mathematical framework for quantum theory,…

Category Theory · Mathematics 2021-09-07 Hayato Saigo

This paper is a contribution to the construction of non-semisimple modular categories. We establish when M\"uger centralizers inside non-semisimple modular categories are also modular. As a consequence, we obtain conditions under which…

Quantum Algebra · Mathematics 2023-05-04 Robert Laugwitz , Chelsea Walton

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2021-11-30 Thomas Ehrhard
‹ Prev 1 2 3 10 Next ›