Structural Computing Requirements for the Transformation of Structures and Behaviors

  • Kenneth M. Anderson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1903)


The field of structural computing is a new paradigm of computation based on structure as opposed to data. Initial work in this area has suggested the need for the transformation of structures, especially when considering the interpretation of a structure from domain A within domain B. This work examines the need for formal mechanisms to specify both structures and the legal ways in which structures can be transformed from one structure to another. We motivate this discussion with an example from the domain of programming languages. In addition, we briefly present an example from the domain of genetic algorithms that suggests the need to consider transformations on behaviors as well. We conclude by enumerating the benefits to structural computing if such formalisms are developed and suggest possible first avenues of exploration.


Genetic Algorithm Evolutionary Computation Parse Tree Structural Computing Structure Server 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, K. M. (1999). Software Engineering Requirements for Structural Computing. In Proceedings of the First International Workshop on Structural Computing. Darmstadt, Germany. February 21, 1999. <>.
  2. 2.
    Brumby, S. P., Theiler J., Perkins S., Harvey N., Szymanski J. J., Bloch J. J., and Mitchell M. (1999). Investigation of Image Feature Extraction by a Genetic Algorithm. In Proceedings of SPIE (International Society for Optical Engineering), Volume 3812, Special Issue on the Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation II, Bosacchi, Bruno, Fogel, David B., Bezdek, James C. (eds.), November 1999.Google Scholar
  3. 3.
    Marshall, C. C., Shipman, F. M., III, and Coombs, J. H. (1994). VIKI: Spatial Hypertext Supporting Emergent Structure. In Proceedings of the Sixth ACM Conference on Hypertext, pp. 13–23. Edinburgh, Scotland. September 18–23, 1994.Google Scholar
  4. 4.
    Mitchell, M. and Taylor, C. E. (1999). Evolutionary Computation: An Overview. In Annual Review of Ecology and Systematics, 20:593–616.CrossRefGoogle Scholar
  5. 5.
    Nürnberg, P. J., Leggett, J. J., and Schneider, E. R. (1997). As We Should Have Thought. In Proceedings of the Eighth ACM Conference on Hypertext, pp. 96–101. Southampton, UK. April 6–11, 1997.Google Scholar
  6. 6.
    Parunak, H. V. D. (1991). Don’t Link Me In: Set Based Hypermedia for Taxonomic Reasoning. In Proceedings of the Third ACM Conference on Hypertext, pp. 233–242. San Antonio, Texas, USA. December 15–18, 1991.Google Scholar
  7. 7.
    Rosenberg, J. (1999). A Hypertextuality of Arbitrary Structure: A Writer’s Point of View. In Proceedings of the First International Workshop on Structural Computing. Darmstadt, Germany. February 21, 1999.Google Scholar
  8. 8.
    Smolensky, P., Bell, B., Fox, B., King, R., and Lewis, C. (1987). Constraint-Based Hypertext for Argumentation. In Proceedings of the First ACM Conference on Hypertext, pp. 215–245. Chapel Hill, NC, USA. November 1987.Google Scholar
  9. 9.
    W. M. Waite. (1992). ELI: A Complete, Flexible Compiler Construction System. In A CM Computing Practices, Vol. 35, No. 2, February 1992Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kenneth M. Anderson
    • 1
  1. 1.Department of Computer ScienceUniversity of Colorado, BoulderBoulder

Personalised recommendations