Pattern-matching and rewriting rules for group indexed data structures

In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-based programming style for functions. This framework is implemented in an experimental language called MGS. The underlying notions funding our framework have a topological nature and enable to extend the case-based definition of functions found in modern functional languages beyond algebraic data structures.

[1]  Vincenzo Manca,et al.  Logical string rewriting , 2001, Theor. Comput. Sci..

[2]  Jean-Louis Giavitto,et al.  Data Structure as Topological Spaces , 2002, UMC.

[3]  E. A. Ashcroft,et al.  LUCID: The data flow programming language , 1985 .

[4]  Johan Jeuring.  The derivation of a hierarchy of algorithms for pattern matching on arrays , 1992 .

[5]  Theodore P. Baker.  A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension , 1978, SIAM J. Comput..

[6]  Jean-Louis Giavitto,et al.  Group-Based Fields , 1995, PSLS.

[7]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[8]  Cécile Germain,et al.  A Static Approach for Compiling Communications in Paranel Scientific Programs , 1995, Sci. Program..

[9]  J. R. Pierce,et al.  Symposium on Information Theory in Biology , 1959 .

[10]  Marina Chen,et al.  Crystal: theory and pragmatics of generating efficient parallel code , 1991 .

[11]  Daniel Le Métayer,et al.  A new computational model and its discipline of programming , 1986 .

[12]  Jean-Louis Giavitto,et al.  A Data Parallel Java Client-Server Architecture for Data Field Computations over Zn , 1998, Euro-Par.

[13]  Jean-Louis Giavitto,et al.  MGS: a Rule-Based Programming Language for Complex Objects and Collections , 2001, Electron. Notes Theor. Comput. Sci..

[14]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[15]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[16]  Thomas Chaboud.  About Planar Cayley Graphs , 1995, FCT.

[17]  Jean-Louis Giavitto,et al.  Declarative definition of group indexed data structures and approximation of their domains , 2001, PPDP '01.

[18]  Jean-Louis Giavitto,et al.  The Topological Structures of Membrane Computing , 2002, Fundam. Informaticae.

[19]  Richard M. Karp,et al.  The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.

[20]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[21]  Björn Lisper,et al.  Data Parallelism and Functional Programming , 1996, The Data Parallel Programming Model.