Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language. CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey pro...

Buffering architectures and policies for their efficient management constitute one of the core ingredients of a network architecture. In this work we introduce a new specification language, BASEL, that allows to express virtual buffering architectures and management policies representing a variety of economic models. BASEL does not require the user to implement policies in a high-level language...

Introduction. This paper analyses the level of development of the press archives of the thirteen Spanish newspapers with the largest digital circulations. Method. This is evaluative research based on twenty indicators divided into four main sections: general features, the query system, presentation of results and other features. The benchmarks for all the indicators were the Lexis-Nexis, Factiv...

Since the end of the 1950s László Kalmár has been interested in the information technology. During a 20 years period he designed several variants of computers interpreting high-level programming languages on architectural

This paper presents a strategy to simplify the programming of heterogeneous distributed systems. Our approach is based on integrating a high-level distributed programming model, called the process model, directly into programming languages. Distributed applications written in such languages are portable across di erent environments, are shorter, and are simpler to develop than similar applicati...

In a large class of hard-real-time control applications, components execute concurrently on distributed nodes and must coordinate, under timing constraints, to perform the control task. As such, they perform a type of atomic commitment. Traditional atomic commitment differs, however, because there are no timing constraints; agreement is eventual. We therefore define timed atomic commitment (TAC...

GESTYLE is a new markup language to annotate text which has to be spoken by Embodied Conversational Agents (ECA), to prescribe the usage of hand-, headand facial gestures accompanying the speech in order to augment the communication. The annotation ranges from low level (e.g. perform a specific gesture) to high level (e.g. take turn in a conversation) instructions. On top of that, and central t...

The quality of the Software Refinery KBSE environment derives significantly from the quality of its embedded Refine programming language. While Refine provides strong support for many modern high-level programming paradigms (functional, logic, object-oriented and metaprogramming), a number of improvements seem appropriate. These improvements are motivated through analysis of Refine’s existing c...

To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a high-level language that makes it easy for designers to specify their goals. We consider a high-level specification language that results from...