English
Related papers

Related papers: On the Expressiveness of Joining

200 papers

Comparing relational languages by their logical expressiveness is well understood. Less well understood is how to compare relational languages by their ability to represent relational query patterns. Indeed, what are query patterns other…

Databases · Computer Science 2024-01-11 Wolfgang Gatterbauer , Cody Dunne

Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation,…

Logic in Computer Science · Computer Science 2012-11-20 Pedro Baltazar , Dimitris Mostrous , Vasco T. Vasconcelos

We investigate how contracts can be used to regulate the interaction between processes. To do that, we study a variant of the concurrent constraints calculus presented in [1], featuring primitives for multi-party synchronization via…

Programming Languages · Computer Science 2010-10-28 Massimo Bartoletti , Roberto Zunino

Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers have identified many uses of spatial conjunction, its…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Just as the $\lambda$-calculus uses three primitives (abstraction, application, variable) as the foundation of functional programming, inheritance-calculus uses three primitives (record, definition, inheritance) as the foundation of…

Programming Languages · Computer Science 2026-05-27 Bo Yang

This work proposes tractable bisimulations for the higher-order pi-calculus with session primitives (HOpi) and offers a complete study of the expressivity of its most significant subcalculi. First we develop three typed bisimulations, which…

Logic in Computer Science · Computer Science 2015-02-11 Dimitrios Kouzapas , Jorge A. Pérez , Nobuko Yoshida

Natural language allows us to refer to novel composite concepts by combining expressions denoting their parts according to systematic rules, a property known as \emph{compositionality}. In this paper, we study whether the language emerging…

Computation and Language · Computer Science 2020-04-21 Rahma Chaabouni , Eugene Kharitonov , Diane Bouchacourt , Emmanuel Dupoux , Marco Baroni

In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…

Logic in Computer Science · Computer Science 2025-05-21 Kostia Chardonnet , Marc de Visme , Benoît Valiron , Renaud Vilmart

We study the expressive power of the LARA language -- a recently proposed unified model for expressing relational and linear algebra operations -- both in terms of traditional database query languages and some analytic tasks often performed…

Databases · Computer Science 2019-09-27 Pablo Barceló , Nelson Higuera , Jorge Pérez , Bernardo Subercaseaux

Human languages vary widely in how they encode information within circumscribed semantic domains (e.g., time, space, color, human body parts and activities), but little is known about the global structure of semantic information and nothing…

Computation and Language · Computer Science 2024-02-19 Pedro Aceves , James A. Evans

Code-mixed discourse combines multiple languages in a single text. It is commonly used in informal discourse in countries with several official languages, but also in many other countries in combination with English or neighboring…

Computation and Language · Computer Science 2025-04-16 Anjali Yadav , Tanya Garg , Matej Klemen , Matej Ulcar , Basant Agarwal , Marko Robnik Sikonja

We investigate the expressive power of regular expressions for languages of countable words and establish their expressive equivalence with logical and algebraic characterizations. Our goal is to extend the classical theory of regular…

Logic in Computer Science · Computer Science 2025-05-05 Thomas Colcombet , A V Sreejith

Grammatical features such as number and gender serve two central functions in human languages. While they encode salient semantic attributes like numerosity and animacy, they also offload sentence processing cost by predictably linking…

Computation and Language · Computer Science 2025-06-23 Emily Cheng , Francesca Franzon

We analyse the expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued…

Artificial Intelligence · Computer Science 2014-05-06 Hannes Strass

Human emotional expression emerges through coordinated vocal, facial, and gestural signals. While speech face alignment is well established, the broader dynamics linking emotionally expressive speech to regional facial and hand motion…

Multimedia · Computer Science 2025-06-13 Von Ralph Dane Marquez Herbuela , Yukie Nagai

Population protocols are a model of distributed computation intended for the study of networks of independent computing agents with dynamic communication structure. Each agent has a finite number of states, and communication opportunities…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-19 Mikhail Raskin

Join patterns are a high-level programming construct for message-passing applications. They offer an intuitive and declarative approach for specifying how concurrent and distributed components coordinate, possibly depending on complex…

Programming Languages · Computer Science 2026-03-09 Ayman Hussein , Philipp Haller , Ioannis Karras , Hernán Melgratti , Alceste Scalas , Emilio Tuosto

Code-mixing, the blending of multiple languages within a single conversation, introduces a distinctive challenge, particularly in the context of response generation. Capturing the intricacies of code-mixing proves to be a formidable task,…

Computation and Language · Computer Science 2024-01-25 Shivani Kumar , Tanmoy Chakraborty

We study algorithmic complexity and expressive power of fusion grammars, a novel formalism introduced in [Kreowski, Kuske, and Lye 2017], which extends hyperedge replacement grammars. In the first part of the work, we prove that the…

Formal Languages and Automata Theory · Computer Science 2025-03-25 Tikhon Pshenitsyn

Human language defines the most complex outcomes of evolution. The emergence of such an elaborated form of communication allowed humans to create extremely structured societies and manage symbols at different levels including, among others,…

Physics and Society · Physics 2014-03-14 Ricard V. Solé , Luís F. Seoane