Search

ARCHERY is an architectural description language for modelling and reasoning about distributed, heterogeneous and dynamically reconfigurable systems in terms of architectural patterns. The language supports the specification of architectures and their reconfiguration. This paper introduces a language extension for precisely describing the structural design decisions that pattern instances must respect in their (re)configurations. The extension is a propositional modal logic with recursion and nominals referencing components, i.e., a hybrid µ-calculus. Its expressiveness allows specifying safety and liveness constraints, as well as paths and cycles over structures. Refinements of classic architectural patterns are specified. [ABSTRACT FROM AUTHOR]

Scala and its multi-threaded model based on actors represent an excellent framework for developing purely reactive agents. This paper presents an early research on extending Scala with declarative programming constructs, which would result in a new agent-oriented programming language suitable for developing more advanced, BDI agent architectures. The main advantage the new language over many other existing solutions for programming BDI agents is a natural and straightforward integration of imperative and declarative programming constructs, fitted under a single development framework. [ABSTRACT FROM AUTHOR]

This paper describe the relationship between C++ templates and partial evaluation. In C++, templates were designed to support generic programming, but not deliberately provided the ability to perform compile-time computations and code generation. These features are completely deliberate, and as a result their syntax is ill at ease. After a review, these features in terms of partial evaluation, a much simpler syntax can be achieved. In C++, it may be regarded as a two-level language in which types are first-class values. Template instantiation resembles an offline partial assessor. In this paper, we explain groundwork in the direction of a single mechanism based on Partial Evaluation which unifies generic programming, compile-time computation and code generation. The language Catat is introduced to demonstrate these ideas. [ABSTRACT FROM AUTHOR]

We briefly discuss the selected aspects of natural language evolution adopting them subsequently on humancomputer language evolution in an automated manner. Coming out from semantic realism and considering communication between humans and machines, we show a formal language with associated informal meaning is abstractly interpretable by machines, and it is conceptualized in an automated manner. We present the idea of the automated evolution of formal humancomputer languages based on clear separation of an informal meaning which is measured, symbolized, conceptualized and, as a result recognized via symbols by machines, i.e. in a formal manner. Using grammatical methods for human-computer language conceptualization, the machine evolves formal language, reflecting human brain concepts without the need for understanding them. [ABSTRACT FROM AUTHOR]

Polymorphism means one thing exists in many forms of its own with each form having different implementation of its own. Polymorphism can be compile time or runtime. It is concern of lifetime of object. The lifetime can be determined at compile time or runtime. The compiler has a such knowledge to determine static analysis of source code. [ABSTRACT FROM AUTHOR]