Short communication: Higher-order communications for concurrent programming

  • Authors:
  • Alberto Pettorossi;Andrzej Skowron

  • Affiliations:
  • -;-

  • Venue:
  • Parallel Computing
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

In Pettorossi and Skowron (1983) a recursive-equations language is introduced. Its operational semantics is specified by means of computing agents which communicate and exchange messages. Those communications are, so to speak, zero-order, in the sense that the exchanged messages are values of a data structure, possibly defined by the programmer. In this paper we extend that approach and we consider also 'higher-order' communications by allowing the exchange of agents behaviours, i.e. sets of computations, among computing agents. This extension leads to a new programming methodology which makes use of proofs of computing agents behaviours and their related strategies.