Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
On the relation between functional and data parallel programming languages
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The typed polymorphic label-selective λ-calculus
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
One-way cellular automata on Cayley graphs
Theoretical Computer Science
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for the recursive definition of data structures
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
The topological structures of membrane computing
Fundamenta Informaticae - Membrane computing
PSLS '95 Proceedings of the International Workshop on Parallel Symbolic Languages and Systems
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Declarative definition of group indexed data structures and approximation of their domains
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Pattern-matching and rewriting rules for group indexed data structures
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Pattern-matching and rewriting rules for group indexed data structures
ACM SIGPLAN Notices
The Chemical Reaction Model Recent Developments and Prospects
Software-Intensive Systems and New Computing Paradigms
Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems
Software-Intensive Systems and New Computing Paradigms
Rule-based programming for integrative biological modeling
Natural Computing: an international journal
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A graph-based developmental swarm representation and algorithm
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Computations in space and space in computations
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
The modeling and the simulation of the fluid machines of synthetic biology
CMC'11 Proceedings of the 12th international conference on Membrane Computing
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 0.00 |
In this paper, we propose a topological metaphor for computations: computing consists in moving through a path in a data space and making some elementary computations along this path. This idea underlies an experimental declarative programming language called MGS. MGS introduces the notion of topological collection: a set of values organized by a neighborhood relationship. The basic computation step in MGS relies on the notion of path : a path C is substituted for a path B in a topological collection A. This step is called a transformation and several features are proposed to control the transformation applications. By changing the topological structure of the collection, the underlying computational model is changed. Thus, MGS enables a unified view on several computational mechanisms. Some of them are initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, Paun systems and cellular automata).