In this paper, I present Underspecified Minimal Recursion Semantics (UMRS), a representation language that represents structural ambiguities in terms of underspecifica-tion. It is argued that this kind of approach allows for transparent semantic representations and a straightforward syntax-semantics interface. UMRS is a semantic metalanguage, whose expressions describe expressions of an object ...

This paper presents a functional programming language, based on Moggi’s monadic metalanguage. In the first part of this paper, we show how the language can be regarded as a monad on a category of signatures, and that the resulting category of algebras is equivalent to the category of computationally cartesian closed categories. In the second part, we extend the language to include a nondetermin...

Programming of technical tasks can often be viewed as translation from one formal language into another. Thus suitable translators can improve productivity. Depot4 is a metasystem for rapid development of translators. Its unique translation centered metalanguage is for efficiency and ease of use by non-experts. The implementation, which is by preprocessing, benefits from the innovative features...

Higher-level graphical and lexical punctuation (paragraphing, indentation, font changes, ...) must be taken into consideration in comprehension processes and text generation. In this paper, we analyse a class of text punctuation marks which includes lexical units (chapter, introduction). We give a method for the analysis of the semantics of these units, in terms of metalanguage. In addition, th...

We describe a first proposal for a strategy language for Maude, to control the rewriting process and to be used at the object level instead of at the metalevel. We also describe a prototype implementation built over Full Maude using the metalevel and the metalanguage facilities provided by Maude. Finally, we include a series of examples that illustrate the main features of the proposed language.

We define an interpretation of the Isabelle/HOL logic in HOL Light and its metalanguage, OCaml. Some aspects of the Isabelle logic are not representable directly in the HOL Light object logic. The interpretation thus takes the form of a set of elaboration rules, where features of the Isabelle logic that cannot be represented directly are elaborated to functors in OCaml. We demonstrate the effec...

Pāṇini’s fourth (?) century BCE Sanskrit grammar uses rewrite rules guided by an explicit and formal metalanguage. The metalanguage makes extensive use of auxiliary markers, in the form of Sanskrit phonemes, to control grammatical derivations. The method of auxiliary markers was rediscovered by Emil Post in the 1920s and shown capable of representing universal computation. The same potential co...