Semantics of Query-Driven Communication of Exact Values

: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet efficiently. We extend the established concept of lazy communication using streams of approximants by introducing explicit queries. We formalise this approach using protocols of a queryanswer nature. Such protocols enable processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. A lattice-theoretic denotational semantics of channel and process behaviour is developed. The query space is modelled as a continuous lattice in which the top element denotes the query demanding all the information, whereas other elements denote queries demanding partial and/or local information. Answers are interpreted as elements of lattices constructed over suitable domains of approximations to the exact objects. An unanswered query is tre...

• Type: Journal
• Year: 2010
• Where: JUCS
• Authors: Michal Konecný, Amin Farjudian
• Keywords: Convergence Rates, Denotational Semantics, JUCS 2010, Lattice-theoretic Denotational Semantics