Search results for "Program Or Be Programmed"
Items we need to order for you
Programming in Modula-3
by Joseph Weizenbaum Since the dawn of the age of computers, people have cursed the difficulty of programming. Over and over again we encounter the suggestion that we should be able to communicate to a computer in natural language what we want it to do. Unfortunately, such advice rests upon a misconception of both the computer and its task. The computer might not be stupid, but it is stubborn. That is, the computer does what all the details of its pro gram command it to do, i. e. , what the programmer "tells" it to do. And this can be quite different from what the programmer intended. The misun derstanding with respect to tasks posed to the computer arises from the failure to recognize that such tasks can scarcely be expressed in natural language, if indeed at all. For example, can we practice music, chemistry or mathematics without their respective special symbolic languages? Yet books about computers and programming languages can be written more or less reasonably, even if they are not quite poetic or lyrical. This book can serve as an example of this art and as a model for anyone at tempting to teach inherently difficult subject matters to others. Klagenfurt, April 1995 Preface Striving to make learning to program easier, this book addresses primarily students beginning a computer science major. For our program examples, we employ a new, elegant programming language, Modula-3.
R 1,604.86
Meta-Programming and Model-Driven Meta-Program Development
Meta-Programming and Model-Driven Meta-Program Development: Principles, Processes and Techniques presents an overall analysis of meta-programming, focusing on insights of meta-programming techniques, heterogeneous meta-program development processes in the context of model-driven, feature-based and transformative approaches.The fundamental concepts of meta-programming are still not thoroughly understood, in this well organized book divided into three parts the authors help to address this. Chapters include: Taxonomy of fundamental concepts of meta-programming; Concept of structural heterogeneous meta-programming based on the original meta-language; Model-driven concept and feature-based modeling to the development process of meta-programs; Equivalent meta-program transformations and metrics to evaluate complexity of feature-based models and meta-programs; Variety of academic research case studies within different application domains to experimentally verify the soundness of the investigated approaches.Both authors are professors at Kaunas University of Technology with 15 years research and teaching experience in the field. Meta-Programming and Model-Driven Meta-Program Development: Principles, Processes and Techniques is aimed at post-graduates in computer science and software engineering and researchers and program system developers wishing to extend their knowledge in this rapidly evolving sector of science and technology.
R 4,280.02
Subrecursive Programming Systems
1.1. What This Book is About This book is a study of * subrecursive programming systems, * efficiency/program-size trade-offs between such systems, and * how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem- bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par- ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
R 3,031.28
Meta-Programming and Model-Driven Meta-Program Development
Meta-Programming and Model-Driven Meta-Program Development: Principles, Processes and Techniques presents an overall analysis of meta-programming, focusing on insights of meta-programming techniques, heterogeneous meta-program development processes in the context of model-driven, feature-based and transformative approaches.The fundamental concepts of meta-programming are still not thoroughly understood, in this well organized book divided into three parts the authors help to address this. Chapters include: Taxonomy of fundamental concepts of meta-programming; Concept of structural heterogeneous meta-programming based on the original meta-language; Model-driven concept and feature-based modeling to the development process of meta-programs; Equivalent meta-program transformations and metrics to evaluate complexity of feature-based models and meta-programs; Variety of academic research case studies within different application domains to experimentally verify the soundness of the investigated approaches.Both authors are professors at Kaunas University of Technology with 15 years research and teaching experience in the field. Meta-Programming and Model-Driven Meta-Program Development: Principles, Processes and Techniques is aimed at post-graduates in computer science and software engineering and researchers and program system developers wishing to extend their knowledge in this rapidly evolving sector of science and technology.
R 4,279.69
Effektiv Programmieren in C
Chat sich in den letzten lahren als die wichtigste hohere Programmiersprache herausgestellt. 1m Microcomputer-Bereich sind praktisch alle groBen Stan- dardprogramme wie dBASE, Lotus und auch das neue Betriebssystem OS/2 in C geschrieben. Die neue Generation von C-Compilern, die den WEITEK-Copro- zessor untersrutzen, erreichen an einem mit 25 MHz getakteten 80386-Rechner fast die Rechnerleistung einer V AX. Auch in den groBen Rechenzentren, die bisher liberwiegend Fortran oder Cobol eingesetzt haben, wird zunehmend C verwendet. An Minicomputern und Workstations dominierte schon immer UNIX und damit auch C. Dieses Buch solI zeigen, daB C eine universelle Programmiersprache ist, die fUr die verschiedensten Zwecke - nicht nur fUr die Systemprogrammierung - ge- eignet ist. Wie vielseitig einsetzbar C ist, wird insbesondere in drei Themenbe- reichen ausfUhrlich dargestellt. Zum ersten wird gezeigt, daB sich in C die vielfiiltigsten Algorithmen elegant und prazise darstellen lassen. Die hier aufgefUhrten Algorithmen erfassen The- men aus Kalenderrechnung, Finanz-Mathematik, Operations Research, Suchen und Sortieren, intelligente ProblemlOsung, Zufallszahlen und Simulationen. Ein zweites Ziel war, zu demonstrieren, in welch einfacher Weise in C aIle wichtigen Datenstrukturen implementiert werden konnen. Es werden statische Datentypen wie Vektoren, Polynome, Matrizen, Polarkoordinaten, komplexe Zahlen besprochen wie auch die dynamischen Typen Stacks, verkettete Listen und Binarbaume behandelt. Als drittes wird aufgezeigt, wie zweckmaBig sich in C die wichtigsten Pro- grammierprinzipien formulieren lassen. AusfUhrlich werden die grundlegen- den Verfahren wie Iteration, Rekursion, Teile-und-Herrsche-Prinzip, Backtrak- king, Branch & Bound und Simulationen besprochen.
R 1,687.69
Subrecursive Programming Systems
1.1. What This Book is About This book is a study of * subrecursive programming systems, * efficiency/program-size trade-offs between such systems, and * how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem- bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par- ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
R 3,032.18
Objektorientierte Programmierung in Oberon-2
Der Autor führt den Leser von den Grundlagen objektorientierter Programmierung über Entwurfs- und Codierungstechniken hin zu einer realistischen Fallstudie in Form eines objektorientierten Fenstersystems mit Text- und Grafikeditor. In UML-Notation wird gezeigt, wofür sich objektorientierte Programmierung eignet und welche Probleme man mit ihr lösen kann. Als Programmiersprache wird Oberon-2 verwendet, ein moderner Nachfolger von Pascal. Die dritte Auflage enthält neue Kapitel über Entwurfsmuster und Kontrakte, ein erweitertes Kapitel über Frameworks sowie ein Glossar.Die beigefügte CD-ROM enthält Oberon-2-Compiler für Windows 95/NT, PowerMac und LINUX. Weitere Oberon-2-Compiler sind von der ETH Zürich erhältlich.
R 3,135.95
Program Monitoring and Visualization
This book presents software visualization at a level suitable for a senior level undergraduate or graduate course, or for the interested technical professional. The approach is to give a survey of the field, and then present a specific research framework designed to reduce the effort required to write visualization tools. A wide range of simple program control flow and data structure visualizations are then presented as examples of how to obtain information about program behavior, and how to present it graphically. Source code fragments and screen images illustrate each example.
R 1,545.07
