Most researchers now agree that subcategorization correlates significantly with semantics. But this semantic component of linking has proved elusive. Most, if not all, theories of linking have, in pratice, resorted to constructs that are syntactic diacritics. We show in this paper that the implicit syntactic diacritics that plague the basic linking constraints posited in at least some of these ...

This study is an attempt to carry out a comparative analysis using Natural Semantic Metalanguage (henceforth NSM). The offering routine patterns of native Persian speakers was compared with that of Native American English speakers to see if it can provide evidence for applicability of NSM model which is claimed to be universal. The descriptive technique was the cultural scripts approach, using ...

A previously unnoticed metalogical paradox about contraposition is formulated in the informal metalanguage of propositional logic, where it exploits a reflexive self-non-application of the truth table definition of the material conditional to achieve semantic diagonalization. Three versions of the paradox are considered. The main modal formulation takes as its assumption a conditional that arti...

syntax – describes the ―essence‖ of the model; the abstract syntax representation is independent of any particular concrete representation Concrete syntax – describes how a model can be represented concretely. For example, with programming languages the concrete syntax includes punctuation, etc. that is not included in the abstract syntax. A concrete syntax can be either textual or visual. Doma...

X ML is becoming a standard for data communication over the Internet. Like HTML, it is a markup language, but it supports a richer set of features, such as userdefined tags that allow both data and descriptive information about data to be represented within a single document. At the same time, presentation aspects remain decoupled from data representation. XML’s flexibility lets it serve as a m...

Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree representing this computation and guiding the user through it to find the wrong statement. This paper presents the fundamentals for the declarative debugging of rewriting logic specifications, realized in the Maude language, wh...

The manipulation of CLP(<) programs in CLP(<) is severely limited, since equality for this language is not based on the syntactic structure of terms. We propose an extended language, CLP(< + M), which provides a basis for (a) coding terms in a form which allows arbitrary structural manipulation, and (b) converting between terms and their coded forms. Importantly, CLP(<+ M) may not only be used ...

We introduce the arrow calculus, a metalanguage for manipulating Hughes’s arrows with close relations both to Moggi’s metalanguage for monads and to Paterson’s arrow notation. Arrows are classically defined by extending lambda calculus with three constructs satisfying nine (somewhat idiosyncratic) laws; in contrast, the arrow calculus adds four constructs satisfying five laws (which fit two wel...