English
Related papers

Related papers: Structural Rules and Algebraic Properties of Inter…

200 papers

HCI researchers' and practitioners' awareness of intersectionality has been expanding, producing knowledge, recommendations, and prototypes for supporting intersectional populations. However, doing intersectional HCI work is uniquely…

Human-Computer Interaction · Computer Science 2022-01-27 Margaret Burnett , Martin Erwig , Abrar Fallatah , Christopher Bogart , Anita Sarma

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

Logic · Mathematics 2025-07-16 Sergey Slavnov

We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been…

Programming Languages · Computer Science 2015-03-18 Mário Pereira , Sandra Alves , Mário Florido

We study properties of the category of modules of an algebra object A in a tensor category C. We show that the module category inherits various structures from C, provided that A is a Frobenius algebra with certain additional properties. As…

Category Theory · Mathematics 2007-05-23 J. Fuchs , C. Schweigert

A construction is proposed for linear connections on non-commutative algebras. The construction relies on a generalisation of the Leibnitz rules of commutative geometry and uses the bimodule structure of $\Omega^1$. A special role is played…

High Energy Physics - Theory · Physics 2010-04-06 J. Mourad

Recent works by Asada, Ong and Tsukada have championed a rigid description of resources. Whereas in non-rigid paradigms (e.g., standard Taylor expansion or non-idempotent intersection types), bags of resources are multisets and invariant…

Logic in Computer Science · Computer Science 2018-01-25 Pierre Vial

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

cmp-lg · Computer Science 2008-02-03 Martin Mueller , Joachim Niehren

Distributional models are derived from co-occurrences in a corpus, where only a small proportion of all possible plausible co-occurrences will be observed. This results in a very sparse vector space, requiring a mechanism for inferring…

Computation and Language · Computer Science 2016-08-25 Thomas Kober , Julie Weeds , Jeremy Reffin , David Weir

We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…

Logic in Computer Science · Computer Science 2025-04-16 Thomas Ehrhard , Aymeric Walch

Modelling qualitative uncertainty in formal argumentation is essential both for practical applications and theoretical understanding. Yet, most of the existing works focus on \textit{abstract} models for arguing with uncertainty. Following…

Artificial Intelligence · Computer Science 2026-02-18 Carlo Proietti , Antonio Yuste-Ginel

In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial…

Logic in Computer Science · Computer Science 2023-06-22 Delia Kesner , Pierre Vial

This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FLe-algebras). In particular,…

Logic · Mathematics 2024-11-20 Davide Fazio , Gavin St. John

We develop a tropical intersection formalism of forms and currents that extends classical tropical intersection theory in two ways. First, it allows to work with arbitrary polytopes, also non-rational ones. Second, it allows for smooth…

Algebraic Geometry · Mathematics 2022-08-30 Andreas Mihatsch

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Combinatorics · Mathematics 2014-10-13 Cheyne Homberger

This paper is a short empirical study of the performance of centrality and classification based iterative term set expansion methods for distributional semantic models. Iterative term set expansion is an interactive process using…

Computation and Language · Computer Science 2018-02-15 Amaru Cuba Gyllensten , Magnus Sahlgren

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

I discuss the general formalism of two-dimensional topological field theories defined on open-closed oriented Riemann surfaces, starting from an extension of Segal's geometric axioms. Exploiting the topological sewing constraints allows for…

High Energy Physics - Theory · Physics 2018-06-25 C. I. Lazaroiu

We present a theory of threads, interleaving of threads, and interaction between threads and services with features of molecular dynamics, a model of computation that bears on computations in which dynamic data structures are involved.…

Logic in Computer Science · Computer Science 2010-05-18 J. A. Bergstra , C. A. Middelburg

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

Idempotents dominate the structure theory of rings. The Peirce decomposition induced by an idempotent provides a natural environment for defining and classifying new types of rings. This point of view offers a way to unify and to expand the…

Rings and Algebras · Mathematics 2017-02-20 P. N. Anh , G. F. Birkenmeier , L. van Wyk