Language-endowed intelligent agents benefit from leveraging lexical knowledge falling at different points along a spectrum of compositionality. This means that robust computational lexicons should include not only the compositional expectations of argument-taking words, but also non-compositional collocations (idioms), semi-compositional collocations that might be difficult for an agent to inte...

Writing efficient, correct programs to process complex XML documents can be time-consuming and difficult. While data binding frameworks automate translating untyped, structured XML data into strongly typed data structures, their overhead, in terms of configuration during development and maintenance, and CPU at runtime, may be prohibitive. We present an open source XML-Java data binding framewor...

Verification of functional correctness of control programs is an essential task for the development of space electronics; it is difficult and time-consuming and typically outweighs design and programming tasks in terms of development hours. We present a verification approach designed to help spacecraft engineers reduce the effort required for formal verification of low-level control programs ex...

The article is devoted to the problematic issue of genre-style interaction musical traditions East and West in Vocal cycle «From songs Hiroshima» by Ivan Karabyts. relevance research fact that phenomenon between chamber-vocal works Ukrainian composers second half 20th century remains little studied art history. Therefore, purpose study identify dominants vocal Songs Karabyts aspect dialogue cul...

The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of prog...

Using contextual equivalence (a.k.a. observational equivalence) to specify security properties is an important idea in the field of formal verification of cryptographic protocols. While contextual equivalence is difficult to prove directly, one is usually able to deduce it using so-called logical relations in typed λ-calculi. We apply this technique to the cryptographic metalanguage — an extens...

We build the reasoning tool of metalanguage support (MS) with the embedded mechanism of the invention of predicates and metapredicates for the comprehension and synthesis tasks. This tool, based on metalanguage representation with weakened soundness, gains the inference flexibility to represent the formal scenarios (for example, a limited class of "logical" anecdotes, derived from NL). We intro...

XML's metalanguage aspect and extensive tool support make it an attractive way to build modularly extensible modeling languages. XML's original metalanguage , the document type definition (DTD), is being replaced by the more expressive XML schema. Developing programmatic tools to manipulate models specified in XML schemas is made easier though the use of data bindings. Data-bindings model eleme...

Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and deenitions in such logics can be implemented with a great economy of expression. We encode a polymorphic higher-order logic using the ML-style polymorphism of Prolog. The terms of the metalanguage (Prolog) can be used to express the statement of a lemma, and metalanguage type-...