{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:37:22Z","timestamp":1743140242410,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030217587"},{"type":"electronic","value":"9783030217594"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21759-4_17","type":"book-chapter","created":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T23:30:20Z","timestamp":1559518220000},"page":"289-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On a Higher-Order Calculus of Computational Fields"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2319-0375","authenticated-orcid":false,"given":"Giorgio","family":"Audrito","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2702-5702","authenticated-orcid":false,"given":"Mirko","family":"Viroli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8109-1706","authenticated-orcid":false,"given":"Ferruccio","family":"Damiani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8392-5409","authenticated-orcid":false,"given":"Danilo","family":"Pianini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1663-5102","authenticated-orcid":false,"given":"Jacob","family":"Beal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-92408-3_1","volume-title":"Coordination Models and Languages","author":"G Audrito","year":"2018","unstructured":"Audrito, G., Beal, J., Damiani, F., Viroli, M.: Space-time universality of field calculus. In: Di Marzo Serugendo, G., Loreti, M. (eds.) COORDINATION 2018. LNCS, vol. 10852, pp. 1\u201320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92408-3_1"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Audrito, G., Damiani, F., Viroli, M., Casadei, R.: Run-time management of computation domains in field calculus. In: 2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W), pp. 192\u2013197. IEEE (2016). https:\/\/doi.org\/10.1109\/FAS-W.2016.50","DOI":"10.1109\/FAS-W.2016.50"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/3285956","volume":"20","author":"G Audrito","year":"2019","unstructured":"Audrito, G., Viroli, M., Damiani, F., Pianini, D., Beal, J.: A higher-order calculus of computational fields. ACM Trans. Comput. Logic 20(1), 5:1\u20135:55 (2019). https:\/\/doi.org\/10.1145\/3285956","journal-title":"ACM Trans. Comput. Logic"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00521-010-0382-8","volume":"19","author":"J Bachrach","year":"2010","unstructured":"Bachrach, J., Beal, J., McLurkin, J.: Composable continuous space programs for robotic swarms. Neural Comput. Appl. 19(6), 825\u2013847 (2010)","journal-title":"Neural Comput. Appl."},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Beal, J., Dulman, S., Usbeck, K., Viroli, M., Correll, N.: Organizing the aggregate: languages for spatial computing. In: Mernik, M. (ed.) Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, chap. 16, pp. 436\u2013501. IGI Global (2013). https:\/\/doi.org\/10.4018\/978-1-4666-2092-6.ch016","DOI":"10.4018\/978-1-4666-2092-6.ch016"},{"issue":"9","key":"17_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MC.2015.261","volume":"48","author":"Jacob Beal","year":"2015","unstructured":"Beal, J., Pianini, D., Viroli, M.: Aggregate programming for the internet of things. IEEE Comput. 48(9) (2015). https:\/\/doi.org\/10.1109\/MC.2015.261","journal-title":"Computer"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3105758","volume":"12","author":"J Beal","year":"2017","unstructured":"Beal, J., Viroli, M., Pianini, D., Damiani, F.: Self-adaptation to device distribution in the internet of things. ACM Trans. Auton. Adapt. Syst. 12(3), 12:1\u201312:29 (2017). https:\/\/doi.org\/10.1145\/3105758","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177\u2013213 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00231-5","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.2307\/1968337","volume":"33","author":"A Church","year":"1932","unstructured":"Church, A.: A set of postulates for the foundation of logic. Ann. Math. 33(2), 346\u2013366 (1932). https:\/\/doi.org\/10.2307\/1968337","journal-title":"Ann. Math."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.entcs.2007.02.011","volume":"172","author":"P Curien","year":"2007","unstructured":"Curien, P.: Definability and full abstraction. Electromic Notes Theorerical Comput. Sci. 172, 301\u2013310 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.011","journal-title":"Electromic Notes Theorerical Comput. Sci."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.scico.2015.11.005","volume":"117","author":"F Damiani","year":"2016","unstructured":"Damiani, F., Viroli, M., Beal, J.: A type-sound calculus of computational fields. Sci. Comput. Program. 117, 17\u201344 (2016). https:\/\/doi.org\/10.1016\/j.scico.2015.11.005","journal-title":"Sci. Comput. Program."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-19195-9_8","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"F Damiani","year":"2015","unstructured":"Damiani, F., Viroli, M., Pianini, D., Beal, J.: Code mobility meets self-organisation: a higher-order calculus of computational fields. In: Graf, S., Viswanathan, M. (eds.) FORTE 2015. LNCS, vol. 9039, pp. 113\u2013128. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19195-9_8"},{"key":"17_CR13","unstructured":"Giavitto, J.L., Godin, C., Michel, O., Prusinkiewicz, P.: Computational models for integrative and developmental biology. Technical report, 72-2002, Univerite d\u2019Evry, LaMI (2002)"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/503502.503505","volume":"23","author":"A Igarashi","year":"2001","unstructured":"Igarashi, A., Pierce, B.C., Wadler, P.: Featherweight Java: a minimal core calculus for Java and GJ. ACM Trans. Program. Lang. Syst. 23(3), 396\u2013450 (2001). https:\/\/doi.org\/10.1145\/503502.503505","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538942.1538945","volume":"18","author":"M Mamei","year":"2009","unstructured":"Mamei, M., Zambonelli, F.: Programming pervasive and mobile computing applications: the TOTA approach. ACM Trans. Softw. Eng. Methodol. 18(4), 1\u201356 (2009). https:\/\/doi.org\/10.1145\/1538942.1538945","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"17_CR16","unstructured":"Nagpal, R.: Programmable self-assembly: constructing global shape using biologically-inspired local interactions and origami mathematics. Ph.D. thesis, MIT, Cambridge, MA, USA (2001)"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Newton, R., Welsh, M.: Region streams: functional macroprogramming for sensor networks. In: Workshop on Data Management for Sensor Networks, pp. 78\u201387. ACM, August 2004. https:\/\/doi.org\/10.1145\/1052199.1052213","DOI":"10.1145\/1052199.1052213"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Nishiwaki, Y.: Digamma-calculus: a universal programming language of self-stabilizing computational fields. In: 2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W). IEEE (2016). https:\/\/doi.org\/10.1109\/FAS-W.2016.51","DOI":"10.1109\/FAS-W.2016.51"},{"key":"17_CR19","unstructured":"Stoughton, A.: Fully abstract models of programming languages. Research Notes in Theoretical Computer Science, Pitman (1988)"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/3177774","volume":"28","author":"M Viroli","year":"2018","unstructured":"Viroli, M., Audrito, G., Beal, J., Damiani, F., Pianini, D.: Engineering resilient collective adaptive systems by self-stabilisation. ACM Trans. Model. Comput. Simul. 28(2), 16:1\u201316:28 (2018). https:\/\/doi.org\/10.1145\/3177774","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-92408-3_12","volume-title":"Coordination Models and Languages","author":"M Viroli","year":"2018","unstructured":"Viroli, M., Beal, J., Damiani, F., Audrito, G., Casadei, R., Pianini, D.: From field-based coordination to aggregate computing. In: Di Marzo Serugendo, G., Loreti, M. (eds.) COORDINATION 2018. LNCS, vol. 10852, pp. 252\u2013279. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92408-3_12"},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1968513.1968517","volume":"6","author":"M Viroli","year":"2011","unstructured":"Viroli, M., Casadei, M., Montagna, S., Zambonelli, F.: Spatial coordination of pervasive services through chemical-inspired tuple spaces. ACM Trans. Auton. Adapt. Syst. 6(2), 14:1\u201314:24 (2011). https:\/\/doi.org\/10.1145\/1968513.1968517","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Whitehouse, K., Sharp, C., Brewer, E., Culler, D.: Hood: a neighborhood abstraction for sensor networks. In: Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. ACM Press (2004). https:\/\/doi.org\/10.1145\/990064.990079","DOI":"10.1145\/990064.990079"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21759-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:04:15Z","timestamp":1685750655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21759-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030217587","9783030217594"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21759-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/forte","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}