White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Isomorphic Types for Open Coordination Systems

Wilkinson, A. and Wood, A. (2005) Isomorphic Types for Open Coordination Systems. In: Zheng, Z.Q., (ed.) Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems. PDCS 2005, November 14 – 16, 2005, Phoenix, AZ, USA. ACTA Press , pp. 404-408.

Full text not available from this repository.

Abstract

Open coordination systems traditionally force pro grammers to use a very limited set of types when com municating. As the system is open nothing is known at creation time about which processes will connect, how many of them there will be and what types they will use. This paper describes the first steps in an architecture to allow open systems, such as Linda, to coordi nate heterogeneous processes using general datatypes. By describing types in terms of products, sums and functions and providing functions that translate between this abstract representation and the concrete representation in the program, types can be trans ferred between programs which have no prior knowl edge of each other’s type systems. Combining this with a type isomorphism algorithm allows types that are not identical but are equivalent to be used in com munications between processes.

Item Type: Proceedings Paper
Academic Units: The University of York > Computer Science (York)
Depositing User: York RAE Import
Date Deposited: 06 Apr 2009 16:30
Last Modified: 06 Apr 2009 16:33
Status: Published
Publisher: ACTA Press
URI: http://eprints.whiterose.ac.uk/id/eprint/7335

Actions (login required)

View Item View Item