A Higher-Order Calculus of Computational Fields
From MaRDI portal
Publication:4617982
DOI10.1145/3285956zbMath1407.68326arXiv1610.08116OpenAlexW2541133209MaRDI QIDQ4617982
Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Jacob Beal, Danilo Pianini
Publication date: 7 February 2019
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08116
full abstractionadequacytype soundnessspatial computingtype inference systemcomputational fieldcore calculusaggregate programming
Related Items (7)
Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala ⋮ AbU: a calculus for distributed event-driven programming with attribute-based interaction ⋮ On a higher-order calculus of computational fields ⋮ A Higher-Order Calculus of Computational Fields ⋮ From distributed coordination to field calculus and aggregate computing ⋮ Unnamed Item ⋮ Near-optimal knowledge-free resilient leader election
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Order-sorted unification
- A set of postulates for the foundation of logic
- Mobile ambients
- From distributed coordination to field calculus and aggregate computing
- Pure bigraphs: structure and dynamics
- Definability and Full Abstraction
- Type-based Self-stabilisation for Computational Fields
- Processes in Space
- A Higher-Order Calculus of Computational Fields
- Processes and the denotational semantics of concurrency
- Generative communication in Linda
- Time-adaptive self stabilization
- Agents and Peer-to-Peer Computing
- Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
This page was built for publication: A Higher-Order Calculus of Computational Fields
