DATA-STRUCTURES AND PROGRAM TRANSFORMATION

被引：71

作者：

MALCOLM, G ^{[1
]}

机构：

[1] STATE UNIV GRONINGEN,DEPT COMP SCI,9700 AV GRONINGEN,NETHERLANDS

来源：

SCIENCE OF COMPUTER PROGRAMMING | 1990年 / 14卷 / 2-3期

关键词：

D O I：

10.1016/0167-6423(90)90023-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The construction of structure-preserving maps, "homomorphisms", is described for an arbitrary data type, and a "promotion" theorem is derived for proving equalities of homomorphisms. Examples are given for finite lists, tree structures and types defined by mutual induction; the construction is then dualised to data types with infinite objects, such as infinite lists. The promotion theorem allows the development of concise, calculational proofs: several examples are given of its application to program transformation. © 1990.

引用

页码：255 / 279

页数：25