Generative communication in Linda
From MaRDI portal
Publication:5184391
DOI10.1145/2363.2433zbMath0559.68030OpenAlexW2161307885MaRDI QIDQ5184391
Publication date: 1985
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1985-7/
Lindasystems programmingdistributed programming languagecontinuation passingdistributed sharingGenerative communicationstructured naming
Related Items
Expired data collection in shared dataspaces. ⋮ Implementing set objects in dynamic distributed systems ⋮ Distributed programming with logic tuple spaces ⋮ Abstractions for fault-tolerant global computing ⋮ Efficient exhaustive listings of reversible one dimensional cellular automata ⋮ On the Expressiveness of Symmetric Communication ⋮ Asynchronous communication model based on linear logic ⋮ A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications ⋮ Basic observables for a calculus for global computing ⋮ On the collective sort problem for distributed tuple spaces ⋮ Logic programming as a service ⋮ Service oriented computing from a process algebraic perspective ⋮ Architectural CCS ⋮ A process algebraic view of Linda coordination primitives ⋮ Refining multiset transformers ⋮ Entailment-based actions for coordination ⋮ Comparing three coordination models: Reo, ARC, and PBRD ⋮ simpA: an agent-oriented approach for programming concurrent applications on top of Java ⋮ Fairness in shared invocation servicing ⋮ Expressiveness of concurrent intensionality ⋮ Event-Based Service Coordination ⋮ New architectures for constructed complex systems ⋮ Linear constraint systems as high-level nets ⋮ Towards a process calculus for REST: current state of the art ⋮ Symbolic execution of Reo circuits using constraint automata ⋮ A model of context-dependent component connectors ⋮ On Byzantine generals with alternative plans ⋮ A semantic theory of the Internet of things ⋮ A Higher-Order Calculus of Computational Fields ⋮ The inhibition spectrum and the achievement of causal consistency ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ On the expressiveness of multiplicities in data-based coordination languages ⋮ Causal-consistent rollback in a tuple-based language ⋮ A process algebraic view of shared dataspace coordination ⋮ Blackboard relations in the \(\mu\text{Log}\) coordination model ⋮ From flow logic to static type systems for coordination languages ⋮ Providing data confidentiality against malicious hosts in shared data spaces ⋮ Formal ReSpecT ⋮ Channel-based coordination via constraint satisfaction ⋮ From distributed coordination to field calculus and aggregate computing ⋮ The ARC Programming Model – Language Constructs for Coordination ⋮ Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints ⋮ Semantic models of a timed distributed dataspace architecture ⋮ A coordination approach to mobile components ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ A principled exploration of coordination models ⋮ Wide-area parallel programming using the remote method invocation model ⋮ Event based choreography ⋮ The Calculus of Handshake Configurations ⋮ Comparing communication primitives via their relative expressive power ⋮ Multiple-Labelled Transition Systems for nominal calculi and their logics ⋮ Full Abstraction for Linda ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) ⋮ Dynamic management of capabilities in a network aware coordination language ⋮ LMNtal as a hierarchical logic programming language ⋮ Comparative analysis of the expressiveness of shared dataspace coordination ⋮ Defining Actions in Concurrent Declarative Programming ⋮ A transition system semantics for the control-driven coordination language MANIFOLD ⋮ Comparing three semantics for Linda-like languages ⋮ Types for access control ⋮ Linda-based applicative and imperative process algebras ⋮ NetWorkSpace: A coordination system for high-productivity environments ⋮ The seal calculus ⋮ Towards an integration science. The influence of Richard Bellman on our research. ⋮ MOMI: a calculus for mobile mixins ⋮ Quantitative information in the tuple space coordination model ⋮ Programming Autonomic Systems with Multiple Constraint Stores ⋮ On the expressiveness of Linda coordination primitives. ⋮ Trace and testing equivalence on asynchronous processes ⋮ Structuring Operational Semantics: Simplification and Computation ⋮ Comparing Three Coordination Models: Reo, ARC, and RRD ⋮ Coordination Models Orc and Reo Compared ⋮ Synchrony vs Asynchrony in Communication Primitives ⋮ Algebraic specification of agent computation ⋮ An algebraic approach for modelling organisation, roles and contexts in MAS
Uses Software
