This article demonstrates a method for composing a programming language by combining action-semantics modules. Each module is defined separately, and then a new module is defined by either extending or combining exist...
详细信息
An increasing number of today's consumer devices such as mobile phones or tablet computers are equipped with various sensors. The extraction of useful information such as gestures from sensor-generated data based ...
详细信息
An increasing number of today's consumer devices such as mobile phones or tablet computers are equipped with various sensors. The extraction of useful information such as gestures from sensor-generated data based on mainstream imperative languages is a notoriously difficult task. Over the last few years, a number of domain-specific programminglanguages have been proposed to ease the development of gesture detection. Most of these languages have adopted a declarative approach allowing programmers to describe their gestures rather than having to manually maintain a history of event data and intermediate gesture results. While these declarative languages represent a clear advancement in gesture detection, a number of issues are still unresolved. In this paper we present relevant criteria for gesture detection and provide an initial classification of existing solutions based on these criteria in order to foster a discussion and identify opportunities for future gesture programminglanguages.
A novel approach is proposed for automatic generation of concurrent interpreters for formal specifications of the programminglanguages. It consists of a formal notation and supporting algorithms. The formal notation ...
详细信息
ISBN:
(纸本)081860865X
A novel approach is proposed for automatic generation of concurrent interpreters for formal specifications of the programminglanguages. It consists of a formal notation and supporting algorithms. The formal notation is called action equations, which are attribute grammars extended by the concepts of events and unification. The supporting algorithms include preprocessing algorithms to generate the interpreters and evaluation algorithms embedded in the generated interpreters. Attribute grammars are reviewed, the extension to the action equations paradigm is explained, and the synthesis of action equations with a unification strategy as a means for specifying and implementing synchronization primitives is presented. The approach is illustrated by a specification of CSP. A brief comparison to related work is included.
The author maintains that fourth-generation languages have greatly improved programmer productivity over the last decade. Recent systems have introduced tools which use screen forms and menu selection to build ad hoc ...
详细信息
ISBN:
(纸本)0818607270
The author maintains that fourth-generation languages have greatly improved programmer productivity over the last decade. Recent systems have introduced tools which use screen forms and menu selection to build ad hoc applications quickly and easily. The most significant aspect of this trend is the advent of tools which give sophisticated programming capabilities to end-users. This trend is expected to significantly expand the demand for information center resources.
The authors provide a hierarchy of proof techniques for deriving the timing properties of real-time distributed programs. First, they provide a static characterization of real-time distributed programs using the maxim...
详细信息
The authors provide a hierarchy of proof techniques for deriving the timing properties of real-time distributed programs. First, they provide a static characterization of real-time distributed programs using the maximum-parallelism model and show that several interesting timing characteristics can be derived from such an analysis. The static analysis is based on complete trace structures. Using prefix-closed trace structures (under the maximal-parallelism model), the authors define two proof systems, referred to as syntactic and general proof systems. The syntactic proof system uses assertions (postulates) attached to the I/O commands (essentially, reflecting the enablement or otherwise of the guards) rather than state information. Using such a system, it is possible to refine several of the timing properties obtained by the static analysis. All the proof systems are compositional and they form a hierarchy. The hierarchy not only establishes the consistency of the systems but also provides the user a selection of proof systems depending on the requirements. Further, the algorithms based on the static analysis lead to algorithmic derivation of the timing properties of a wide variety of real-time programs.
作者：
Ahmad, ShaheenImperial Coll of Science &
Technology Dep of Mechanical Engineering London Engl Imperial Coll of Science & Technology Dep of Mechanical Engineering London Engl
The design requirements of robot level languages are outlined by considering an automation example with a robot. The design features of SRIL-90 robot control language are then presented, together with their implicatio...
详细信息
ISBN:
(纸本)0818605502
The design requirements of robot level languages are outlined by considering an automation example with a robot. The design features of SRIL-90 robot control language are then presented, together with their implication on overall arm control. SRIL-90 is then compared with the more advanced robot control languages currently available in research and industrial environments. programming examples with SRIL-90 language are also presented, which illustrate the versatility and usefulness of the language. The multiprocessor control system on which SRIL-90 is implemented on is also briefly described.
Introductory programming courses can be taught in a variety of languages that are current with industry demands and support essential features such as object oriented programming. programminglanguages can also be com...
详细信息
暂无评论