Previous research in visual query languages has fo-cused on pre-deened visual representations of data and queries, which are suitable for speciic applications, but diicult to extend and generalize. In this paper we propose a metalanguage to query an object-oriented database with user-deened pictures. By manipulating these pictures, the user can extract information about the data in a purely vis...

This paper introduces MLSOS, a functional metalanguage for declaring and animating definitions of structural operational semantics. The language provides a general mechanism for resolution-based search that respects the αequivalence of object-language binding structures, based on nominal unification. It combines that with a FreshML-style generative treatment of bound names. We claim that MLSOS ...

Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...

This paper reviews discourse phenomena that occur frequently in task.oriented man.machine dialogs, reporting on a~n empirical study that demonstrates the necessity of handling ellipsis, anaphora, extragrammaticality, inter-sentential metalanguage, and other abbreviatory devices in order to achieve convivial user interaction. Invariably, users prefer to generate terse or fragmentary utterances i...

This paper reviews discourse phenomena that occur frequently in task.oriented man.machine dialogs, reporting on a~n empirical study that demonstrates the necessity of handling ellipsis, anaphora, extragrammaticality, inter-sentential metalanguage, and other abbreviatory devices in order to achieve convivial user interaction. Invariably, users prefer to generate terse or fragmentary utterances i...

The paper discusses the syntactic-semantic and contextual features of a nonpredicate formal structure as an exponent basic temporal clause. It is type condensation extensive (developed) dependent sentence form that has no either nominalization or verbid processes summarizing structures, i.e. their propositions. reduction, special process in which certain elements are omitted ? rule, predicate c...

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

if your preferred environment requires only a few features from another paradigm, you must typically adopt the whole alien platform to take advantage of them. The alternative of using other languages and tools to implement the features in a way that avoids adding the whole platform is generally at least as difficult. But a more affordable solution is often possible. We used metaprogramming to i...