Implementing a data definition facility driven by graph grammars

Authors:
P. B. Barroso;A. L. Furtado
Affiliations:
Pontificia Universidade Católica do R.J., Rio de Janeiro, Brasil;Pontificia Universidade Católica do R.J., Rio de Janeiro, Brasil
Venue:
Computer Languages
Year:
1978

Citing 4
Cited 0

GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept

Communications of the ACM
Toward an understanding of data structures

Communications of the ACM
The ECL programming system

AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Specification techniques for data abstractions

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.