论文信息 - Implementing a Data Definition Facility Driven by Graph Grammars

Implementing a Data Definition Facility Driven by Graph Grammars

The implementation of a data definition facility based on graph transformations is discussed. The theory of graph grammars allows a precise characterization of these transformations, facilitating proofs of correctness. The implementation consists of an extension to PL/I, and utilizes the standard PL/I preprocessor.

Antonio L. Furtado | P. B. Barroso

[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[2] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3] Philippe Jorrand. Data types and extensible languages , 1971 .

[4] Jay Earley,et al. Toward an understanding of data structures , 1971, SIGFIDET '70.

[5] Ben Wegbreit. The ECL programming system , 1972, AFIPS '71 (Fall).

[6] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms (Working Paper) , 1971, SWAT.

[7] Azriel Rosenfeld,et al. Web Grammars , 1969, IJCAI.

[8] Stephen N. Zilles,et al. Specification techniques for data abstractions , 1975 .

[9] Thomas A. Standish,et al. A Data Definition Facility for Programming Languages , 1967, Outstanding Dissertations in the Computer Sciences.

[10] Antonio L. Furtado,et al. Characterizing sets of data structures by the connectivity relation , 1976, International Journal of Computer & Information Sciences.

[11] John C. Reynolds,et al. GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.