On a higher-order calculus of computational fields

DOI10.1007/978-3-030-21759-4_17MaRDI QIDQ6190190zbMATH OpenOpenAlexFDO

Authors Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Danilo Pianini, Jacob Beal

Publication date 6 February 2024

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-21759-4_17

zbMATH Keywords

computational adequacycore calculusdenotational semanticsdistributed computingoperational semanticstype system

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A higher-order calculus of computational fields
• From distributed coordination to field calculus and aggregate computing
• Asynchronous distributed execution of fixpoint-based computational fields
• Type-based self-stabilisation for computational fields
• A calculus for collective-adaptive systems and its behavioural theory

Cites work

• A higher-order calculus of computational fields
• A set of postulates for the foundation of logic
• Definability and full abstraction
• scientific article; zbMATH DE number 194122 (Why is no real title available?)
• Mobile ambients

Cited in

(4)

• Time-fluid field-based coordination through programmable distributed schedulers
• Field-based coordination with the share operator
• Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala
• FBFL: a field-based coordination approach for data heterogeneity in federated learning

This page was built for publication: On a higher-order calculus of computational fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190190)