Citation Context

...emantics caused us ongoing frustration, and led to multiple third-party efforts at clarifying our intended operational semantics by examining our interpreter, P2, more closely than perhaps it merited =-=[58, 54]-=-. q(V,R)@next :- q(V,R), !del_q(V,R). qmin(V, min<R>) :- q(V,R). p(V,R)@next :- q(V,R), qmin(V,R). del_q(V,R) :- q(V,R), qmin(V,R). Figure 2: A queue implementation in Dedalus. Predicate q represents ...

Citation Context

...er distributed systems, both because we have considerable practical experience with these languages [2, 20], and because others have examined the semantic ambiguities of these languages in some depth =-=[23, 26]-=-. In this paper we reconsider declarative programming for distributed systems from a model-theoretic perspective. We introduce a declarative language called Dedalus 1 that enables the specification of...

Citation Context

... al. [24]. In general, however, the language extensions proposed in much of this prior work added expressivity and domain applicability but compromised declarativity, making formal analysis difficult =-=[25, 7]-=-. Recently, Ameloot et al. explored Hellerstein’s CALM theorem using relational transducers [6]. They proved that monotonic first-order queries are exactly those queries that can be computed in a coor...

Citation Context

...ers often resort to C/C++ fragments on ordinary occasions (Singh et al. 2008), while research efforts are invested to better couple the required additional features with the Datalog evaluation model (=-=Mao 2009-=-; Alvaro et al. 2009).2 N. Lopes, J. Navarro, A. Rybalchenko and A. Singh In this paper we explore the applicability of Prolog as a basis for Declarative Networking. In contrast to Datalog, Prolog is...

Citation Context

...stems, and even cluster services. Its claim to fame is using 2a high-level declarative language (e.g., logic or functional languages) to program systems. On the other hand, declarativity is relative =-=[15]-=-, and often alienates programmers: relational elegance aside, not everything is a relation. In our approach we chose a hybrid design, in which we allow programmers to retain an imperative programming ...

Citation Context

...however, the language extensions proposed in much of this prior work added expressivity and domain applicability but compromised the declarative semantics of Datalog, making formal analysis difficult =-=[35, 36]-=-. In designing Dedalus, we tried to recover and extend the model-theoretic analyses applicable to pure Datalog, while preserving the features appropriate to modeling loosely coupled distributed system...

Citation Context

...ode reuse, we introduced Composable Virtual Views [33], which define rule groups that perform a specific functionality when executed together. These extensions offer different levels of declarativity =-=[32]-=- to meet various application demands. The meaning of a NDlog program is defined to be the behavior and output obtained by running the program through PSN evaluation [27, 41]. The Dedalus [19, 5] langu...