Abstract We may suppose that the truth predicate we utilize in our semantic metalanguage is a two-place relating sentences to contexts, truth-in-context-X predicate. Seeming paradoxes pertaining can be blocked by placing restrictions on structure of contexts. While contexts must specify domain and what context constant denotes relative context, no belong its own domain. A generalization restric...

We introduce the arrow calculus, a metalanguage for manipulating Hughes’s arrows with close relations both toMoggi’s metalanguage for monads and to Paterson’s arrow notation.

Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed point recursion as an expressive semantic metalanguage. We study its expressive power from an operational point of view. We show that the naturally call-by-value operators of linear lambda calculus can be given a call-by-name semantics without affecting termination at exponential types and hence without affe...

This study examines four Japanese synonymous verbs that have the same equivalent in English, namely GIVE. These are ageru, kureru, kizou suru, and kifu suru. used a qualitative descriptive method. Example sentences for data were taken from Balance Corpus of Contemporary Written corpus data. The theories applied this argument structure theory Natural Semantic Metalanguage theory. Based on analys...

We present here MXSL, a subset of XSLT re-interpreted as a syntactic metalanguage for RuleML with operational semantics based on XSLT processing. This metalanguage increases the expressivity of RuleML knowledge bases and queries, with syntactic access to the complete XML tree through the XPath Data Model. The metalanguage is developed in an abstract manner, as a paradigm applicable to other KR ...

We introduce a typed metalanguage based on PCF that includes I/O and store operations. We give an applicative characterization of operational equivalence for this language. Finally, we give an example of a translation from an imperative programming language into our metalanguage, and we demonstrate how to use the theory of the metalanguage to reason about terms in the source programming language.

0. To formulate a semantic theory of modal logic it is not sufficient to define for example, the necessary as that which is true in every model and the possible as that which is true in some model. These definitions would do no more than introduce the notions of ‘necessary’ and ‘possible’ in the metalanguage. A semantics of modal logic demands that we assume an object language containing modal ...

A sequent calculus for hybrid logics is developed from a calculus for classical predicat logic by a series of transformations. We formalize the semantic theory of hybrid logic using a sequent calculus for predicate logic plus axioms. This works, but it is ugly. The unnattractive features are removed one-by-one, until the final vestiges of the metalanguage can be set aside to reveal a fully inte...

The Evidential Tool Bus (ETB) is a distributed framework for tool integration for the purpose of building and maintaining assurance cases. ETB employs Datalog as a metalanguage both for defining workflows and representing arguments. The application of Datalog in ETB differs in some significant ways from its use as a database query language. For example, in ETB Datalog predicates can be tied to ...

In [Bundy and Sterling 81] we described how meta-level inference was useful for controlling search and deriving control information in the domain ofalgebra. Similar "techniques are applicable to the verification of logicprograms. A developing metalanguage is described, and an explicit proof plan using this language is given. A program, IMPRESS, is outlined which executes this plan. 1. Introduct...