THỜI GIAN MỞ CỬA: Từ thứ 2 đến thứ 6 (trừ các ngày lễ): Sáng từ 8h00 đến 11h30, Chiều từ 13h30 đến 17h00

Algorithmic language and program development

Bauer, F. L. , Woessner, H.

Berlin-Heidelberg-New York


Algorithmic language and program development

Tác giả: Bauer, F. L. , Woessner, H.
Loại tài liệu: Sách, chuyên khảo, tuyển tập
Ký hiệu: Lv3391
Mã giá: 68BA
Nội dung tóm tắt: Xem chi tiết
The title of this book contains the words ALGORITHMIC LANGUAGE, in the singular. This is meant to convey the idea that it deals not so much with the diversity of programming languages, but rather with their commonalities. The task of formal program development proved to be the ideal frame for demonstrating this unity. It allows classifying concepts and distinguishing fundamental notions from notational features; and it leads immediately to a systematic disposition. This approach is supported by didactic, practical, and theoretical considerations. The clarity of the structure of a programming language designed according to the principles of program transformation is remarkable. Of course there are various notations for such a language. The notation used in this book is mainly oriented towards ALGOL 68, but is also strongly influenced by PASCAL - it could equally well have been the other way round. In the appendices there are occasional references to the styles used in ALGOL, PASCAL, LISP, and elsewhere. The book is divided clearly into three parts: the first four chapters concentrate on the level of applicative formulation, which is characterized by function application as the dominant language element, and includes problem specifications. The transition to the level of procedural formulation - which is characterized by the appearance of program variables - is motivated in Chap. 4 and carried out in Chaps. 5 and 6. In Chap. 7, further development leads to concepts which are particularly important in systems programming for present-day machines: organized stores, pointers and nexuses; characteristically, on this level program variables and pointers are in some sense considered as independent objects. The transitions between these levels are described by definitional transformations. More generally, we view the entire process of programming as being a chain of program transformations; the individual classes of transformation rules prove to be an excellent didactic means for structuring the material.
Mục lục: Xem chi tiết
Introduction. 0.1 On the Etymology of the Word Algorithm. 0.2 How Algorithms are Characterized 0.3 Programming as an Evolutionary Process 0.4 How to Solve it Chapter 1. Routines 1.1 The Parameter Concept 1.2 Declaration of a Routine... 1.3 Hierarchical Construction of Routines 1.4 Recursive Routines and Systems 1.5 Mathematical Semantics: Fixpoint Theory 1.6 Proofs by Induction of Properties of Routines 1.7 Operational Semantics: Machines 1.8 Restriction of the Parameter Domain 1.9 Dijkstra's Guards 1.10 Pre-Algorithmic Formulations by Means of Choice and Determination 1.11 Semantics of Non-Deterministic Constructions 1.12 Routines with a Multiple Result, 1.13 Structuring of Routines 1.14 Routines as Parameters and Results Addendum: Notations Chapter 2. Objects and Object Structures 2.1 Denotations 2.2 Scope of a Freely Chosen Designation 2.3 Kinds of Objects 2.4 Sets of Objects, Modes 2.5 Composite Modes and Objects 2.6 Selectors, Structures with Direct (Selector) Access 2.7 Mode Variants 2.8 Introduction of New Modes: Summary 2.9 Recursive Object Structures 2.10 Algorithms with Linear Object Structures 2.11 The Recursive Object Structure File 2.12 Algorithms with Cascade-Type Object Structures 2.13 Traversal and Scanning of Recursive Object Structures 2.14 Infinite Objects 2.15 Some Peculiarities of Arrays 2.16 Routines with Multiple Results Revisited Addendum: Notations Chapter 3. Computational Structures 3.1 Concrete Computational Structures 3.2 Abstract Computational Structures and Abstract Types 3.3 Abstract Arrays 3.4 Sequence-Type Computational Structures 3.5 Number-Type Computational Structures 3.6 Changing Abstract Types and Object Structures Addendum: Notations Chapter 4. Transformation into Repetitive Form 4.1 Schemes and Transformations . 4.2 Treatment of Linear Recursion 4.3 Treatment of Non-Linear Recursions 4.4 Disentanglement of the Control Chapter 5. Program Variables 5.1 The Origin of Program Variables 5.2 Formal Introduction of Program Variables 5.3 Procedures 5.4 Axiomatic Description of Programming Languages 5.5 Variables for Structured Objects Addendum: Notations Chapter 6. Control Elements 6.1 Deparameterization and Formal Treatment of Repetition 6.2 Jumps 6.3 The General do-od Construction 6.4 Loops 6.5 Loops and Repetitive Systems 6.6 Sequential Circuits 6.7 Flow Diagrams 6.8 Petri Nets 6.9 bool Petri Nets, Signals 6.10 nat Petri Nets, Semaphores Addendum: Notations Chapter 7. Organized Storages and Linked Lists 7.1 Organized Storages 7.2 Identity of Variables and Alias Ban Revisited 7.3 Implementing Object Structures by Organized Storages 7.4 Linked-List Implementation of Organized Storages 7.5 Improvement of Algorithms Working on Linked Lists by Selective Updating 7.6 Addressing Addendum: Notations Conclusion. Programming as an Evolutionary Process Program Specification and Development in a Uniform Language Conceptual Organization of the Algorithmic Language Tools to Be Used Methodology of Programming

Thông tin chi tiết

    Dạng tài liệu:Bản in
    Chỉ số ISBN:3-540-11148-4
    Ngôn ngữ:eng
    Mã giá:68BA
    Mã MSC:Đang cập nhật ...
    Tác giả:Bauer, F. L, Woessner, H
    Nhan đề:Algorithmic language and program development
    Xuất bản, phát hành:H : Berlin-Heidelberg-New York , 1982
    Số trang:497;
    Kích thước:24 cm
    Bộ sách:Texts and Monographs in Computer Science

Thông tin xếp giá

  • ĐKCB: 6845020053896
  • Tổng số bản: 1
  • Tổng số bản rỗi: 1
  • Tổng số đang đặt chỗ: 0

Từ khóa