Abstract : Modern programming languages allow the definition and the use of arbitrary nested data structures but this is not generally considered in unconventional programming models. In this paper, we present arbitrary nesting in MGS, a spatial comput- ing language. By considering different classes of neighborhood relationships, MGS can emulate several unconventional computing models from a programming point of view. The use of arbitrary nested spatial structures allows a hierarchical form of coupling between them. We propose an extension of the MGS pattern- matching facilities to handle directly nesting. This makes possible the straightforward emulation of a larger class of unconventional programming models.
https://hal.archives-ouvertes.fr/hal-00769286
Contributor : Jean-Louis Giavitto
<>
Submitted on : Sunday, December 30, 2012 - 9:42:44 PM
Last modification on : Thursday, March 21, 2019 - 12:58:51 PM
Document(s) archivé(s) le : Sunday, December 18, 2016 - 10:54:55 AM
