The data transform programming method: An example for file processing problems

Authors:
C. J. Lucena;R. C. B. Martins;P. A. S. Veloso;D. D. Cowan
Affiliations:
-;-;-;-
Venue:
ICSE '84 Proceedings of the 7th international conference on Software engineering
Year:
1984

Citing 6
Cited 0

Syntactic source to source transforms and program manipulation

Communications of the ACM
Correctness-preserving program transformations

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logical Construction of Systems

Logical Construction of Systems
Structured Design: Fundamentals of a Discipline of Computer Program and Systems Design

Structured Design: Fundamentals of a Discipline of Computer Program and Systems Design
Program refinement by transformation

ICSE '81 Proceedings of the 5th international conference on Software engineering
Principles of Program Design

Principles of Program Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new programming method, called the data transform programming method. In particular, we present a specialization of data transform programming to deal with file processing applications. Direct comparison is made with Jackson's approach1 by the presentation of uniform solutions to problems that cannot be solved through his basic method. The new method consists of the application of data transformations to the abstract problem statement, following the formal notions of problem reduction and problem decomposition. Data transformations are expressed in programming terms through a basic set of data type constructors.