This paper provides both a fully abstract (domain-theoretic) model for the π -calculus and a universal (set-theoretic) model for the finite π -calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the π -calculus into the metalanguage. A technical novelty of our approach is an a...

The problem of classifying text with respect to metalanguage and language object patterns is formulated and its application areas are proposed. Examples of metalanguage patterns in text are foreign language grammar lessons and tutorials on how to write engineering documents. The method targets the text classification tasks where keyword statistics is insufficient do distinguish between such abs...

The existence of a non-algorithmic side of the mind, conjectured by Penrose on the basis of Gödel’s first incompleteness theorem, is investigated here in terms of a quantum metalanguage. We suggest that, besides ordinary human thought, which can be formalized in a computable, logical language, there is another important kind of human thought, which is Turing-non-computable. This is methatought,...

Model Driven Engineering (MDE) is a promising paradigm for software development. It raises the level of abstraction in software development by treating models as primary artifacts. The definition of a metamodel is a recurring task in MDE and requires sound and formal support. The lack of such support causes deficiencies such as conceptual anomalies in the modeling languages. From philosophical ...

A logic programming language with potential software engineering benefit is described. The language is intended as a specification language where the user specifies software functionality while ignoring efficiency. The goals of the language are: (1) a pure specification language – “what, not how”, (2) small size, and (3) a metalanguage – able to imitate and thus subsume other languages. The lan...

First, three successful environments for artificial evolution in computer systems are analysed briefly. The organism in these enviroment are in a virtual machine with special chemistries. Two key-features are found to be very robust under mutations: Non-direct addressing and separation of instruction and argument. In contrast, the x86 instruction set is very brittle under mutations, thus not ab...

Grammar teaching has been a topic of debate for considerably long time. Researchers and teachers discussed the benefits shortcomings its explicit instruction, which entails students’ awareness metalanguage. Although much research investigated metalanguage, effect on improving grammatical accuracy is still an unresolved issue, concerning it relatively limited. Nevertheless, widely recognised tha...

The presence of side effects in even a very simple language of expressions gives rise to a number of semantic questions. The issue of evaluation order becomes a crucial one and, unless a specific order is enforced, the language becomes non-deterministic. In this paper we study the denotational semantics of such a language under a variety of possible evaluation strategies, from simpler to more c...