We present the design of S-NET, a coordination language and component technology based on stream processing. S-NET achieves a near-complete separation between application code, written in a conventional programming la...
详细信息
We present the design of S-NET, a coordination language and component technology based on stream processing. S-NET achieves a near-complete separation between application code, written in a conventional programming language, and coordination code, written in S-NET itself. S-NET boxes integrate existing sequential code as stream-processing components into streaming networks, whose construction is based on algebraic formulae built out of four network combinators. Subtyping on the level of boxes and networks and a tailor-made inheritance mechanism achieve flexible software reuse.
A declarative programming style is claimed to have significant advantages from a software engineering point of view. However, these benefits cannot generally be realized when writing programs that are concerned with c...
详细信息
A declarative programming style is claimed to have significant advantages from a software engineering point of view. However, these benefits cannot generally be realized when writing programs that are concerned with changing state, such as environments and programming tools. declarative state-transition (DST) systems have been proposed as a solution to this problem. In DST systems, computation and update are separated. Programs are interpreted as defining functions or relations over states, and update follows successful computation of new states. Support for persistent state and atomic, serializable transactions facilitates the implementation of programming environments and tools. This paper describes an implementation scheme for DST systems. The scheme is illustrated by a presentation of the implementation of PPS, a DST system for parallel logic programming.
Modern software applications increasingly benefit from accessing the multifarious and heterogeneous Web of Data, thanks to the use of web APIs and Linked Data principles. In previous work, the authors proposed a platf...
详细信息
Modern software applications increasingly benefit from accessing the multifarious and heterogeneous Web of Data, thanks to the use of web APIs and Linked Data principles. In previous work, the authors proposed a platform to develop applications consuming Linked Data in a declarative and modular way. This paper describes in detail the functional language the platform gives access to, which is based on SPARQL (the standard query language for Linked Data) and on the dataflow paradigm. The language features interactive and meta-programming capabilities so that complex modules/applications can be developed. By adopting a declarative style, it favours the development of modules that can be reused in various specific execution contexts.
We have proposed that scientific research reports should be constructed entirely of structured knowledge rather than text. In an earlier paper, we emphasized Research Designs as a framework for structured research rep...
详细信息
ISBN:
(纸本)9783031168024;9783031168017
We have proposed that scientific research reports should be constructed entirely of structured knowledge rather than text. In an earlier paper, we emphasized Research Designs as a framework for structured research reports and described how a structured implementation might be applied to Pasteur's classic swan-neck flask experiment. In this paper, we examine some of the issues encountered in developing that implementation using dynamic models. For instance, we consider issues associated with modeling state transitions.
An axiomatization is presented of the denotational semantics for first order language of Apt [1]. The goal is to obtain a rational reconstruction of the intuitions underlying this semantics. The axiomatization combine...
详细信息
An axiomatization is presented of the denotational semantics for first order language of Apt [1]. The goal is to obtain a rational reconstruction of the intuitions underlying this semantics. The axiomatization combines ideas about four valued logic with facts about substitutions. Soundness and completeness of the axiomatization are established. From the completeness proof a decision procedure is obtained that shows how four valued logic and order sensitivity of substitution together add up in a natural way to the denotational semantics for the language of first order logic as proposed by Apt.
We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). ...
详细信息
We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The real-time extensions that have been proposed for the concurrent constraint programming framework are coupled with the object-oriented and inheritance mechanisms that have been developed for logic programs yielding an integrated declarative environment for multimedia objects modelling. composition and synchronisation. The expressiveness and ability of OO-TCCP to act as a basis for building high-level, user-friendly authoring environments is illustrated by presenting a simple object model for multimedia composition and synchronisation followed by an analysis on how it can be used to model the temporal behaviour and relationships of multimedia objects. We then define a "universal" set of multimedia programming primitives and we show how they can be implemented in OO-TCCP. Finally, we argue about the benefits of our approach wrt both easiness of programming and implementation of the proposed framework. To the best of our knowledge this is the first time logic programming (in the form of concurrent constraint programming or otherwise) is used as a basis for designing and implementing multimedia programming frameworks.
The linked data initiative is pushing dataset maintainers to publish data online in a highly reusable way through a set of open standards, such as RDF and SPARQL. The variety and amount of structured data available on...
详细信息
The linked data initiative is pushing dataset maintainers to publish data online in a highly reusable way through a set of open standards, such as RDF and SPARQL. The variety and amount of structured data available on the Web are increasing, but their consumption is still quite limited. In particular, applications that are used to explore linked data are usually generic linked data browsers or applications with hard-coded logic tailored for specific needs. SWOWS is a platform for declarative specification of applications consuming linked data. In this paper, we describe the use of the platform-for creating browsing applications tailored to specific contexts, and show how the declarative paradigm supports the development of flexible applications. To this end, the platform has been extended to support the dynamic generation of SPARQL queries. An example of a linked data browser created with the platform is given. (C) 2014 Elsevier Ltd. All rights reserved.
Functional programming has its roots in Alonzo Church's lambda calculus. A functional program is a collection of functions that work together to transform data. Though Lisp brought functional programming to public...
详细信息
Functional programming has its roots in Alonzo Church's lambda calculus. A functional program is a collection of functions that work together to transform data. Though Lisp brought functional programming to public attention in the 1950s, it was John Backus's 1977 Turing Award lecture criticizing the limitations of imperative programming languages that led to a resurgence of interest in this field. The 1970s and 1980s saw a number of advances, leading to the development of the language Haskell, which carefully combined ideas from many earlier languages. In this article, we explore some basic notions of functional programming via Haskell.
Businesses and software development processes alike are being challenged by the digital transformation and agility trend. Business processes are increasingly being automated yet are also expected to be agile. Current ...
详细信息
ISBN:
(数字)9783319784281
ISBN:
(纸本)9783319784281;9783319784274
Businesses and software development processes alike are being challenged by the digital transformation and agility trend. Business processes are increasingly being automated yet are also expected to be agile. Current business process modeling is typically labor-intensive and results in rigid process models. For larger processes it becomes arduous to consider all possible process variations and enactment circumstances. Contemporaneously, in software development microservices have become a popular software architectural style for partitioning business logic into fine-grained services accessible via lightweight protocols which can be rapidly and individually developed by small teams and flexibly (re) deployed. This results in an increasing number of available services and a much more dynamic IT service landscape. Thus, a more dynamic form of modeling, integration, and orchestration of these microservices with business processes is needed. This paper describes agile business process modeling with Microflows, an automatic lightweight declarative approach for the workflow-centric orchestration of semantically-annotated microservices using agent-based clients, graph-based methods, and the lightweight semantic vocabularies JSON-LD and Hydra. A graphical modeling tool supports Microflow modeling and provides dynamic constraint and microservice recommendations via a recommender service using machine learning of domain-categorized Microflows. To be able to utilize existing process model knowledge, a case study shows how Microflow constraints can be automatically extracted from existing Business Process Modeling Notation (BPMN) process files and transformed into flexible Microflow constraints, which can then be used to train the recommendation service. Further, it describes process mining of Microflow execution logs to automatically extract BPMN models and automated recovery for errors occurring during enactment.
We find an example of a rooted, finite, partially ordered set Q(g) such that the superintuitionistic logic L(Q(g)) generated by Q(g) has no finite bases for admissible inference rules. The modal logic based on Q(g) al...
详细信息
We find an example of a rooted, finite, partially ordered set Q(g) such that the superintuitionistic logic L(Q(g)) generated by Q(g) has no finite bases for admissible inference rules. The modal logic based on Q(g) also has the same property.
暂无评论