Pattern-matching and rewriting rules for group indexed data structures

Authors:
Jean-Louis Giavitto;Olivier Michel
Affiliations:
LaMI umr 8042 du CNRS, Université d'Évry Val d'Essone, GENOPOLE Tour Évry-2, 523 Place des terasses de l'agora, 91000 Évry, France;LaMI umr 8042 du CNRS, Université d'Évry Val d'Essone, GENOPOLE Tour Évry-2, 523 Place des terasses de l'agora, 91000 Évry, France
Venue:
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Year:
2002

Citing 12
Cited 2

LUCID, the dataflow programming language

LUCID, the dataflow programming language
Crystal: theory and pragmatics of generating efficient parallel code

Parallel functional languages and compilers
The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
A static approach for compiling communications in parallel scientific programs

Scientific Programming
Derivatives of Regular Expressions

Journal of the ACM (JACM)
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)
Logical string rewriting

Theoretical Computer Science
The topological structures of membrane computing

Fundamenta Informaticae - Membrane computing
Group-Based Fields

PSLS '95 Proceedings of the International Workshop on Parallel Symbolic Languages and Systems
A Data Parallel Java Client-Server Architecture for Data Field Computations over Zn

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Data Structure as Topological Spaces

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Data Parallelism and Functional Programming

The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications

Rule-based programming for integrative biological modeling

Natural Computing: an international journal
Declarative mesh subdivision using topological rewriting in MGS

ICGT'10 Proceedings of the 5th international conference on Graph transformations

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 of functions. This framework is implemented in an experimental language called MGS. The underlying notions funding our framework have a topological nature and make possible to extend the case-based definition of functions found in modern functional languages beyond algebraic data structures.