This paper shows how a fully abstract model for a rich metalanguage like FPC can be used to prove theorems about other languages. In particular, we use results obtained from a game semantics of FPC to show that the natural translation of the lazy-calculus into the metalanguage is fully abstract, thus obtaining a new full abstraction result from an old one. The proofs involved are very easy|all ...

A metalanguage for denotational semantics is given a logical interpretation: types are interpreted as propositional theories; terms (in an extended typed λ-calculus, denoting elements of types) are embedded in an endogenous program logic, which characterises their behaviour in terms of which properties they satisfy; terms (in an extension of the algebraic metalanguage of cartesian closed catego...

This study addresses the problem of improving the quality of natural language (NL) understanding by means of the involvement of the additional criterion of correct formal representation of the input inquiry. This criterion is based on the logical compatibility between the input inquiry, translated into the formal language, and the domain, encoded in the same language. Inquiry generality is meas...

The present paper is concerned with the advantages of a digitised descriptive grammar over its traditional print version. First we discuss the process of up-conversion of the ANS material and the main advantages the E-ANS has for the editorial staff. Then from the perspective of language resources, we discuss different applications of the grammatical descriptions for both human and machine user...

c++ is an expressive language, but it does not allow software developers to say all the things about their systems that they need to be able to say. In particular, C+ + offers no way to express many important constraints on a system's design, implementation, and presentation. In this paper, we describe CCEL, a metalanguage for C+ + that allows software developers to express constraints on C+ + ...

We describe a metalanguage MMML, which makes explicit the order of evaluation (in the spirit of monadic metalanguages) and the staging of computations (as in languages for multi-level binding-time analysis). The operational semantics of MMML is very intuitive and consists of two parts: local (semantic preserving) simplification rules, and steps of computation executed in a deterministic order (...

When humans communicate via natural language, they frequently make use of metalanguage to clarify what they mean and promote a felicitous exchange of ideas. One key aspect of metalanguage is the mention of words and phrases, as distinguished from their use. This paper presents ongoing work on identifying and categorizing instances of languagemention, with the goal of building a system capable o...

What is the right way of thinking about the metalanguage in which natural language semantics takes place? I will eventually get to the idea that the best way of understanding the role of this language involves seeing natural language semantics as a model-based science (using ‘model’ in the general sense of a scientific model, not in the technical sense of model theory). To get there, I first cr...

Compile-time reeective ML (CRML) is an extension to Standard ML providing a metalanguage for program manipulationn10]. The original motivation was the automatic generation of map and fold like combinators for arbitrary datatypess4, 9]. The mechanisms developed to achieve this are far more general than we at rst realized, providing the foundation for a rich class of language extensions expressed...