Systematic program design from clarity to efficiency

Machine generated contents note: 1. Introduction; 2. Loops: incrementalize; 3. Sets: incrementalize and implement; 4. Recursion: iterate and incrementalize; 5. Rules: iterate, incrementalize, and implement; 6. Objects: incrementalize across module abstraction; 7. Conclusion.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Liu, Yanhong Annie (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: Cambridge u.a. Cambridge University Press 2013
Schlagworte:
Online Zugang:Cover
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Machine generated contents note: 1. Introduction; 2. Loops: incrementalize; 3. Sets: incrementalize and implement; 4. Recursion: iterate and incrementalize; 5. Rules: iterate, incrementalize, and implement; 6. Objects: incrementalize across module abstraction; 7. Conclusion.
"A systematic program design method can help developers ensure the correctness and performance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient implementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic, and object-oriented programming languages with different data, control, and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Experienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization, and program analysis. The last section of the book points out directions for future studies"--
Beschreibung:Includes bibliographical references (pages 213-233) and index
Beschreibung:XV, 240 S.
Ill.
25 cm
ISBN:1107610796
1-107-61079-6
1107036607
1-107-03660-7
9781107610798
978-1-107-61079-8
9781107036604
978-1-107-03660-4