Algebraic formalisation of program development by transformation

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A uniform treatment of algebraic specification is proposed to formalise data, programs, transformation rules, and program developments. It is shown by example that the development of an efficient transformation algorithm incorporating the effect of a set of transformation rules is analogous to program development: the transformation rules act as specifications for the transformation algorithms.

Cite

CITATION STYLE

APA

Krieg-Brückner, B. (1988). Algebraic formalisation of program development by transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 300 LNCS, pp. 34–48). Springer Verlag. https://doi.org/10.1007/3-540-19027-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free