Accession Number:

ADA171074

Title:

A Rewrite Rule Machine. Programming by Generic Example.

Descriptive Note:

Final rept.,

Corporate Author:

SRI INTERNATIONAL MENLO PARK CA

Personal Author(s):

• Goguen, Joseph A.

Report Date:

1986-07-01

Pagination or Media Count:

20.0

Abstract:

This paper presents some techniques for programming with iconic representations. These techniques promise to make programming in suitable ultra high level languages significantly easier and more intuitive. The languages that we have in mind are based on rewrite rules andor object-oriented programming, and have user-definable abstract data types. One technique uses the notion of constructorfrom the theory of algebraic specifications of abstract data types to automatically generate graphical representations for data values. Another technique permits defining rewrite rules, as well as methods in the sense of object-oriented programming, but the direct manipulation of iconic representations of genetic examples of data values. Some illustrations are given, based on the OBJ functional programming language and its extension to object-oriented programming. Author

Descriptors:

• *COMPUTER PROGRAMMING
• DATA PROCESSING
• SYMBOLS
• HIGH LEVEL LANGUAGES

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE