In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with stacks), and we adapt them to incorporate global exceptions. In each case, we extend the calculus with a construct, due to Benton and Kennedy, that fuses exception handling with sequencing. This immediately gives us an ...

Symmetric monoidal closed categories may be related to one another not only by the functors between them but also by enrichment of one in another, and it was known to G. M. Kelly in the 1960s that there is a very close connection between these phenomena. In this first part of a two-part series on this subject, we show that the assignment to each symmetric monoidal closed category V its associat...

Lexicalized context-free grammar (LCFG) is a tree-based formalism that makes use of both tree substitution and a restricted form of tree adjunction. Because of its use of adjunction, LCFG allows su cient freedom in the way derivations can be performed that lexicalization of context-free grammars (CFGs) is possible while preserving the structure of the trees derived by the CFGs. However, the tre...

In this work, we focus on adjunctions (also named isotone Galois connections) between fuzzy preordered sets; specifically, we study necessary and sufficient conditions that have to be fulfilled in order such an adjunction to exist.

It is shown that every two-variable adjunction in categories enriched a commutative quantale serves as base for constructing Isbell adjunctions between functor categories, and Kan are precisely constructed from suitable associated adjunctions. Representation theorems established fixed points of these

Most cross-linguistic variation in weight criteria is attributed to the parameterized application of Weight-by-Position adjunction to codas on a language-specific basis (Hayes 1989). This paper explores the hypothesis that coda weight is ultimately predictable from syllable structure. An extensive survey of quantity-sensitive stress systems shows that languages that allow a proportionately larg...

We prove injectivity and relative asphericity for "layered" systems of equations over torsion-free groups, when the exponent matrix is invertible over Z.

In this paper, we present a unified feature-based theory of complement, adjunct, and subject extraction, in which there is no need either for valence reducing lexical rules or for phonologically null traces. Our analysis rests on the assumption that the mapping between argument structure and valence is defined by realization constraints which are satisfied by all lexical heads. Arguments can be...

This note has two principal aims: to portray an essence of Non-Standard Analysis as a particular structure (which we call lim-rim), noting its interplay with the notion of ultrapower, and to present a construction of Non-Standard Analysis, viewed as a matter of mathematics, where the set A of non-standard elements of a set A – “the adjunction of all possible limits” is a “good” kind of lim-rim ...