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.

The Tsc2 product, tuberin, negatively regulates the mTOR pathway. We have exploited the Eker (Tsc2-mutant) rat system to analyse various Tsc2 mutations. Here, we focus on the N525S-Tsc2 variant (NSM), which is known to cause distinct symptoms in patients even though normal suppression of mTOR is observed. Unexpectedly, we were repeatedly unable to generate viable rats carrying the NSM transgene...

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...

By means of several examples of structural operational semantics for a variety of languages, we justify the importance and interest of using the notions of strategies and simulations in the semantic framework provided by rewriting logic and implemented in the Maude metalanguage. On the one hand, we describe a basic strategy language for Maude and show its application to CCS, the ambient calculu...

The paper presents a modelling and implementation methodology compatible with the Internet of Things and Linked Data paradigm. Linked data are naturally depicted by a directed graph whose nodes represent Things and edges or arrows relations. The conceptual models of intensional interpretations of first order formal languages are directed graphs. It is therefore natural to base the description l...

A sequent calculus for hybrid logics is developed from a calculus for classical predicate 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 unattractive features are removed one-by-one, until the final vestiges of the metalanguage can be set aside to reveal a fully inte...

This paper describes the process of formalizing an existing, industrial domain specific language (dsl) that is based on the taskresource paradigm. Initially, the semantics of this dsl is defined informally and implicitly through an interpreter. The formalization starts by projecting the existing concrete syntax onto a formal abstract syntax that defines the language operators and process terms....