Symmetric categorial grammar: residuation and Galois connections

The Lambek-Grishin calculus is a symmetric extension of the Lambek calculus: in addition to the residuated family of product, left and right division operations of Lambek’s original calculus, one also considers a family of coproduct, right and left difference operations, related to the former by an arrow-reversing duality. Communication between the two families is implemented in terms of linear distributivity principles. The aim of this paper is to complement the symmetry between (dual) residuated type-forming operations with an orthogonal opposition that contrasts residuated and Galois connected operations. Whereas the (dual) residuated operations are monotone, the Galois connected operations (and their duals) are antitone. We discuss the algebraic properties of the (dual) Galois connected operations, and generalize the (co)product distributivity principles to include the negative operations. We give a continuation-passing-style translation for the new type-forming operations, and discuss some linguistic applications.

💡 Research Summary

The paper extends the Lambek‑Grishin calculus (LG), a symmetric refinement of the original Lambek calculus, by introducing a family of Galois‑connected type‑forming operations that stand in opposition to the already‑present residuated operations. In the standard LG system one has a residuated trio—product (·) together with left and right division (, /)—and, by an arrow‑reversing duality, a co‑family consisting of coproduct (⊕) and left/right difference (⟂). These operations are monotone: enlarging an antecedent never shrinks the consequent. The authors observe that this monotonicity is only one side of a deeper polarity. They therefore add a second polarity: antitone Galois‑connected operations, which they call “negative” or “difference” operations, together with their own duals.

The core technical contribution is a systematic algebraic study of these antitone operations. The authors define a Galois connection between a type A and a type B as a pair of adjoint operators (⇒, ⟂) satisfying A ⇒ B ≤ C iff C ≤ A ⟂ B. This mirrors the familiar residuation condition A·B ≤ C iff A ≤ C / B iff B ≤ A \ C, but the order of the inequality is reversed. Consequently, the new operations are antitone in each argument: if A₁ ≤ A₂ then A₂ ⇒ B ≤ A₁ ⇒ B, and similarly for the difference operator. The paper proves that these operations obey their own set of algebraic laws—associativity, identity, and a form of distributivity—distinct from, yet compatible with, the residuated laws. For instance, they establish (A ⟂ B) ⟂ C = A ⟂ (B·C) and analogous identities for the left‑difference operator.

A major innovation is the generalisation of the linear distributivity principles that originally linked product and coproduct. The authors show that the same principles can be extended to involve the negative operations, yielding new distributive schemata such as (A ⊕ B) ⟂ C ⊢ (A ⟂ C) ⊕ (B ⟂ C) and C ⟂ (A ⊕ B) ⊢ (C ⟂ A) ⊕ (C ⟂ B). These rules capture how a negative operation distributes over a coproduct, mirroring the way product distributes over coproduct in the original LG system.

To give the extended calculus an operational semantics, the paper presents a continuation‑passing‑style (CPS) translation. In this translation, the monotone residuated operations are interpreted as ordinary function types, while the antitone Galois‑connected operations are interpreted as continuations that invert the flow of control. Concretely, a term of type A ⇒ B is translated into a continuation that, given a continuation for B, produces a continuation for A; similarly, a term of type A ⟂ B becomes a continuation that consumes a value of type A to produce a value of type B, but with the direction of the logical arrow reversed. This CPS mapping preserves typing and reduction, thereby demonstrating that the enriched type system can be faithfully embedded in a well‑understood computational framework.

The linguistic relevance of the new operators is illustrated through several natural‑language examples. Sentences involving negation, such as “No student passed,” are modeled by assigning the noun phrase “student” a type that, when combined with the verb phrase “passed” via the difference operator, yields a negative proposition. Quantifiers like “every” and “some” are shown to correspond to combinations of residuated and Galois‑connected operations, allowing the calculus to capture the interaction between universal/existential scope and polarity. The authors argue that the antitone operations give a principled way to represent negative polarity items, presuppositions, and conditional meanings that are awkward to encode using only monotone residuated operators.

In summary, the paper achieves three intertwined goals: (1) it identifies and formalises a dual polarity—monotone residuation versus antitone Galois connection—within the symmetric Lambek‑Grishin framework; (2) it develops the algebraic theory of the antitone operations, extending distributivity and proving coherence with the existing residuated fragment; and (3) it provides a CPS‑style translation that grounds the extended calculus in a computational interpretation and demonstrates its applicability to linguistic phenomena involving negation and quantification. By doing so, the work deepens the logical foundations of categorial grammar and opens new avenues for integrating negative polarity and duality into type‑logical syntax and semantics.