Compilers and interpreters Books

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisBeginning Arduino Programming allows you to quickly and intuitively develop your programming skills through sketching in code. This clear introduction provides you with an understanding of the basic framework for developing Arduino code, including the structure, syntax, functions, and libraries needed to create future projects.Table of Contents Getting Started Sketching in Code Working With Variables Making Decisions Digital Ins and Outs Analog in, Analog out Functions, Time, and Interrupts Arrays for Arduino Writing New Functions for Arduino Arduino Libraries Arduino Hardware 10 Where to Go from Here? Appendix A: Common Circuits Appendix B: Arduino Math

Read more less

Book Synopsis1 Preliminaries: 00 and Design Patterns 101.- 2 Programming with Interfaces, and a Few Creational Patterns.- 3 The Game of Life.- 4 Implementing Embedded SQL.- Appendix A Design-Pattern Quick Reference.- Creational Patterns.- Abstract Factory.- Builder.- Factory Method.- Prototype.- Singleton.- Structural Patterns.- Adapter.- Bridge.- Composite.- Decorator.- Facade.- Flyweight.- Proxy.- Behavioral Patterns.- Chain of Responsibility.- Command.- Interpreter.- Iterator.- Mediator.- Memento.- Observer (Publish/Subscribe).- State.- Strategy.- Template Method.- Visitor.Table of ContentsA table of contents is not available for this title.

Read more less

Table of ContentsVerilog — A Tutorial Introduction.- Logic Synthesis.- Behavioral Modeling.- Concurrent Processes.- Module Hierarchy.- Logic Level Modeling.- Cycle-Accurate Specification.- Advanced Timing.- User-Defined Primitives.- Switch Level Modeling.- Projects.

Read more less

Trade Review“The book is highly readable and starts from basics, like how to install the Arduino integrated development environment (IDE). The appendix of the book has a lot of good information on how and where to order the parts and boards. … I would strongly advise reading the book in a hands-on fashion and not just reading it alone. … High school and beginning college students will have a blast reading it and implementing the programs. I highly recommend it.” (Naga Narayanaswamy, Computing Reviews, April, 2016)Table of Contents Introduction to Arduino Microcontrollers Arduino C Data Types Decision Making in C Program Loops Functions in C Storage Classes and Scope Introduction to Pointers Using Pointers Effectively I/O Operations The C Preprocessor A Gentle Introduction to Object-Oriented Programming Arduino Libraries Arduino I/O Appendix A - Suppliers Appendix B - Hardware Components

Read more less

Book SynopsisSudoku Programming with C teaches you how to write computer programs to solve and generate Sudoku puzzles. However, the author wanted to include a solving program capable of listing the strategies necessary to solve any particular puzzle.Table of Contents1. Modelling a Sudoku Puzzle in C2. The Strategies3. Main Program and Utilities4. Implementing 'unique'5. Implementing 'naked' Strategies6. Implementing 'hidden' Strategies7. Implementing 'box-line'8. Implementing 'pointing-line'9. Implementing 'lines' Strategies10. Implementing 'Y-wing'11. Implementing 'XY-chain'12. Implementing 'rectangle'13. Implementing 'backtrack'14. Solving Thousands of Puzzles15. Generating Sudokus16. Puzzle Statistics17. Puzzles18. Samurai SudokusA. Eclipse CDTB. Puzzle SolutionsC. Abbreviations and AcronymsD. Strategy Index

Read more less

Table of Contents1. Anatomy of a Function2. Inside a Function-Call3. Expressions and Environments4. Manipulating Expressions 5. Working with Substitutions

Read more less

Table of Contents1. Introduction to PHP 82. Interfaces, Platforms, Containers: Three-Tiers Programming3. Modular Programming4. Secure User Interfaces5. Handling and Logging Exceptions6. Data Objects7. Authentication8. Multi-functional Interfaces

Read more less

Book Synopsis* Treats LISP as a language for commercial applications, not a language for academic AI concerns. This could be considered to be a secondary text for the Lisp course that most schools teach . This would appeal to students who sat through a LISP course in college without quite getting it – so a "nostalgia" approach, as in "wow-lisp can be practical…" * Discusses the Lisp programming model and environment. Contains an introduction to the language and gives a thorough overview of all of Common Lisp’s main features. * Designed for experienced programmers no matter what languages they may be coming from and written for a modern audience—programmers who are familiar with languages like Java, Python, and Perl. * Includes several examples of working code that actually does something useful like Web programming and database access. Table of ContentsA table of contents is not available for this title.

Read more less

Book Synopsis*Discusses regular expressions in quick, easy manner (Friedl book is exhaustive, and other two books are superficial) *Teaches by example without exhaustive syntax explanation *Covers the major open source languages Table of Contents Words and Text URLs and Paths CSV and Tab-Delimited Files Formatting and Validating HTML and XML Coding and Using Commands

Read more less

Book SynopsisBecome familiar with the LLVM infrastructure and start using LLVM libraries to design a compiler About This Book • Learn to use the LLVM libraries to emit intermediate representation (IR) from high-level language • Build your own optimization pass for better code generation • Understand AST generation and use it in a meaningful way Who This Book Is For This book is intended for those who already know some of the concepts of compilers and want to quickly get familiar with the LLVM infrastructure and the rich set of libraries that it provides. What You Will Learn • Get an introduction to LLVM modular design and LLVM tools • Convert frontend code to LLVM IR • Implement advanced LLVM IR paradigms • Understand the LLVM IR Optimization Pass Manager infrastructure and write an optimization pass • Absorb LLVM IR transformations • Understand the steps involved in converting LLVM IR to Selection DAG • Implement a custom target using the LLVM infrastructure • Get a grasp of C's frontend clang, an AST dump, and static analysis In Detail LLVM is currently the point of interest for many firms, and has a very active open source community. It provides us with a compiler infrastructure that can be used to write a compiler for a language. It provides us with a set of reusable libraries that can be used to optimize code, and a target-independent code generator to generate code for different backends. It also provides us with a lot of other utility tools that can be easily integrated into compiler projects. This book details how you can use the LLVM compiler infrastructure libraries effectively, and will enable you to design your own custom compiler with LLVM in a snap. We start with the basics, where you'll get to know all about LLVM. We then cover how you can use LLVM library calls to emit intermediate representation (IR) of simple and complex high-level language paradigms. Moving on, we show you how to implement optimizations at different levels, write an optimization pass, generate code that is independent of a target, and then map the code generated to a backend. The book also walks you through CLANG, IR to IR transformations, advanced IR block transformations, and target machines. By the end of this book, you'll be able to easily utilize the LLVM libraries in your own projects. Style and approach This book deals with topics sequentially, increasing the difficulty level in a step-by-step approach. Each topic is explained with a detailed example, and screenshots are included to help you understand the examples.

Read more less

Book SynopsisSemantics will play an important role in the future development of software systems and domain-specific languages. This book provides a needed introductory presentation of the fundamental ideas behind these approaches, stresses their relationship by formulating and proving the relevant theorems, and illustrates the applications of semantics in computer science. Historically important application areas are presented together with some exciting potential applications. The text investigates the relationship between various methods and describes some of the main ideas used, illustrating these by means of interesting applications. The book provides a rigorous introduction to the main approaches to formal semantics of programming languages.Trade ReviewFrom the reviews: "This book title, with its explicit reference to applications, quickly grabbed my attention due to the theoretical nature of formal semantics. … In any case, this book certainly fits the bill for an undergraduate course on the topic. … It also includes plenty of solved examples and exercises for students to help them grasp the key ideas and techniques behind the different mathematical models that can be used to describe the computations performed by a computer program." (Fernando Berzal, Computing Reviews, January, 2008) "This book presents a rigorous introduction to the main three approaches: operational semantics, denotational semantics, and axiomatic semantics. This book investigates the relationship between the various methods, and describes some of the main ideas by using applications. … Several exercises are provided. … help the student to understand definitions, results, and techniques … ." (G. Ciobanu, ACM Computing Reviews, May, 2009)Table of ContentsOperational Semantics.- More on Operational Semantics.- Provably Correct Implementation.- Denotational Semantics.- More on Denotational Semantics.- Program Analysis.- More on Program Analysis.- Axiomatic Program Verification.- More on Axiomatic Program Verification.- Further Reading.

Read more less

Book SynopsisThis excellent addition to the UTiCS series of undergraduate textbooks provides a detailed and up to date description of the main principles behind the design and implementation of modern programming languages.Rather than focusing on a specific language, the book identifies the most important principles shared by large classes of languages. To complete this general approach, detailed descriptions of the main programming paradigms, namely imperative, object-oriented, functional and logic are given, analysed in depth and compared. This provides the basis for a critical understanding of most of the programming languages.An historical viewpoint is also included, discussing the evolution of programming languages, and to provide a context for most of the constructs in use today. The book concludes with two chapters which introduce basic notions of syntax, semantics and computability, to provide a completely rounded picture of what constitutes a programming language.Trade ReviewFrom the reviews:“This undergraduate textbook on the principles of programming languages has many commendable aspects. It is grounded on sound principles of computing, with machines taking a central role. The authors use activation stacks and other machine-level abstractions to explain many complex ideas--such as scopes and evaluation mechanisms--in concrete terms. Furthermore, many aspects of C++, Java, and C# are covered and contrasted in substantial detail. … In short, what the text covers, it covers well … .” (Simon Thompson, ACM Computing Reviews, January, 2011)“This book provides a detailed description of the main principles behind the design and implementation of modern programming languages. … Primarily, the text is intended as a university textbook, but is also suitable for personal study of professionals who wish to deepen their knowledge of the mechanisms that lie behind the languages they use.” (Stefan Meyer, Zentralblatt MATH, Vol. 1204, 2011)Table of ContentsAbstract Machines.- How to Describe a Programming Language.- Foundations.- Names and The Environment.- Memory Management.- Control Structure.- Control Abstraction.- Structuring Data.- Data Abstraction.- The Object-Oriented Paradigm.- The Functional Paradigm.- The Logic Programming Paradigm.- A Short Historical Perspective.

Read more less

Book SynopsisThis book contains the thoroughly refereed technical papers presented in eight workshops collocated with the International Conference on Software Technologies: Applications and Foundations, STAF 2018, held in Toulouse, France, in June 2018. The 65 full papers presented were carefully reviewed and selected from 120 submissions. The events whose papers are included in this volume are: CoSim-CPS 2018: 2nd International Workshop on Formal Co-Simulation of Cyber-Physical Systems DataMod 2018: 7th International Symposium From Data to Models and Back FMIS 2018: 7th International Workshop on Formal Methods for Interactive Systems FOCLASA 2018: 16th International Workshop on Foundations of Coordination Languages and Self-adaptative Systems GCM 2018: 9th International Workshop on Graph Computation Models MDE@DeRun 2018: 1st International Workshop on Model-Driven Engineering for Design-Runtime Interaction in Complex Systems MSE 2018: 3rd International Workshop on Microservices: Science and Engineering SecureMDE 2018: 1st International Workshop on Security for and by Model-Driven Engineering Table of ContentsFormal Co-Simulation of Cyber-Physical Systems (CoSim-CPS).- From Data to Models and Back (DataMod).- Formal Methods for Interactive Systems (FMIS).- Foundations of Coordination Languages and Self-adaptative Systems (FOCLASA).- Graph Computation Models (GCM).- Model-Driven Engineering for Design-Runtime Interaction in Complex Systems (MDE@DeRun).- Microservices: Science and Engineering (MSE).- Security for and by Model-Driven Engineering (MDE).

Read more less

Book SynopsisJava is now well-established as one of the world’s major programming languages, used in everything from desktop applications to web-hosted applications, enterprise systems and mobile devices. Java applications cover cloud-based services, the Internet of Things, self-driving cars, animation, game development, big data analysis and many more domains.The second edition of Foundational Java: Key Elements and Practical Programming presents a detailed guide to the core features of Java – and some more recent innovations – enabling the reader to build their skills and confidence though tried-and-trusted stages, supported by exercises that reinforce the key learning points. All the most useful and commonly applied Java syntax and libraries are introduced, along with many example programs that can provide the basis for more substantial applications. Use of the Eclipse Integrated Development Environment (IDE) and the JUnit testing framework is integral to the book, ensuring maximum productivity and code quality when learning Java, although to ensure that skills are not confined to one environment the fundamentals of the Java compiler and run time are also explained. Additionally, coverage of the Ant tool will equip the reader with the skills to automatically build, test and deploy applications independent of an IDE.Topics and features:• Presents the most up-to-date information on Java, including Java 14• Examines the key theme of unit testing, introducing the JUnit 5 testing framework to emphasize the importance of unit testing in modern software development• Describes the Eclipse IDE, the most popular open source Java IDE and explains how Java can be run from the command line• Includes coverage of the Ant build tool• Contains numerous code examples and exercises throughout• Provides downloadable source code, self-test questions, PowerPoint slides and other supplementary material at the website http://www.foundjava.comThis hands-on, classroom-tested textbook/reference is ideal for undergraduate students on introductory and intermediate courses on programming with Java. Professional software developers will also find this an excellent self-study guide/refresher on the topic.Dr. David Parsons is National Postgraduate Director at The Mind Lab, Auckland, New Zealand. He has been teaching programming in both academia and industry since the 1980s and writing about it since the 1990s.Table of ContentsThe Java StoryCompiling and Running Java ProgramsData Types, Arithmetic and ArraysControl StructuresCreating ObjectsCreating Domain ClassesObjects Working Together: Association, Aggregation and CompositionInheritance, Polymorphism and InterfacesException HandlingUnit Testing With JUnitExploring the Java LibrariesThe Collections Framework and GenericsInput and Output StreamsAutomatic Building and Testing with AntJava and the Database (JDBC)MultithreadingBuilding GUIs with the JFC Swing LibraryEvent Driven ProgrammingDialogs and Menus, Models and ViewsJava Web Start and Applets

Read more less

Book Synopsis.- Current and Future OpenMP Optimization. .- Towards Locality-Aware Host-to-Device Offloading in OpenMP..- Performance Porting the ExaStar Multi-physics App Thornado On Heterogeneous Systems - A Fortran-OpenMP Code-base Evaluation..- Event-Based OpenMP Tasks for Time-Sensitive GPU-Accelerated Systems..- Targeting More Devices. .- Integrating Multi-FPGA Acceleration to OpenMP Distributed Computing..- Towards a Scalable and Efficient PGAS-based Distributed OpenMP..- Multilayer Multipurpose Caches for OpenMP Target Regions on FPGAs..- Best Practices. .- Survey of OpenMP Practice in General Open Source Software..- CI/CD Efforts for Validation, Verification and Benchmarking OpenMP Implementations..- Evaluation of Directive-based Programming Models for Stencil Computation on Current GPGPU Architectures..- Tools. .- Finding Equivalent OpenMP Fortran and C/C++ Code Snippets Using Large Language Models..- Visualizing Correctness Issues in OpenMP Programs..- Developing an Interactive OpenMP Programming Book with Large Language Models..- Simplifying Parallelization. .- Automatic Parallelization and OpenMP Offloading of Fortran Array Notation..- Detrimental Task Execution Patterns in Mainstream OpenMP Runtimes.

Read more less

Book SynopsisOriginally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be a basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete.Trade ReviewFrom the reviews of the fifth edition: "This is the fifth and the most recent edition of a legendary book … . It was probably the first introductory Prolog book and it is still the most gentle introduction to Prolog for everyone, including non-computer scientists. … the book is as great as ever as an introductory text for Prolog. When a newbie asks for an introduction to Prolog, the best advice is still Clocksin & Mellish." (Bart Demoen, TLP-Theory and Practice of Logic Programming, Vol. 5 (3), 2005)Table of Contents1 Tutorial Introduction.- Gives the student a feel for what it is like to program in Prolog. Introduces objects, relationships, facts, rules, variables.- 1.1 Prolog.- 1.2 Objects and Relationships.- 1.3 Programming.- 1.4 Facts.- 1.5 Questions.- 1.6 Variables.- 1.7 Conjunctions.- 1.8 Rules.- 1.9 Summary and Exercises.- 2 A Closer Look.- More detailed presentation of Prolog syntax and data structures.- 2.1 Syntax.- 2.1.1 Constants.- 2.1.2 Variables.- 2.1.3 Structures.- 2.2 Characters.- 2.3 Operators.- 2.4 Equality and Unification.- 2.5 Arithmetic.- 2.6 Summary of Satisfying Goals.- 2.6.1 Successful satisfaction of a conjunction of goals.- 2.6.2 Consideration of goals in backtracking.- 2.6.3 Unification.- 3 Using Data Structures.- Representing objects and relationships by using trees and lists. Developing several standard Prolog programming techniques.- 3.1 Structures and Trees.- 3.2 Lists.- 3.3 Recursive Search.- 3.4 Mapping.- 3.5 Recursive Comparison.- 3.6 Joining Structures Together.- 3.7 Accumulators.- 3.8 Difference Structures.- 4 Backtracking and the “Cut”.- How a set of clauses generates a set of solutions. Using “cut” to modify the control sequence of running Prolog programs.- 4.1 Generating Multiple Solutions.- 4.2 The “Cut”.- 4.3 Common Uses of the Cut.- 4.3.1 Confirming the Choice of a Rule.- 4.3.2 The “cut-fail” Combination.- 4.3.3 Terminating a “generate and test”.- 4.4 Problems with the Cut.- 5 Input and Output.- Facilities available for the input and output of characters and structures. Developing a program to read sentences from the user and represent the structure as a list of words, which can be used with the Grammar Rules of Chapter.- 5.1 Reading and Writing Terms.- 5.1.1 Reading Terms.- 5.1.2 Writing Terms.- 5.2 Reading and Writing Characters.- 5.2.1 Reading Characters.- 5.2.2 Writing Characters.- 5.3 Reading English Sentences.- 5.4 Reading and Writing Files.- 5.4.1 Opening and closing streams.- 5.4.2 Changing the current input and output.- 5.4.3 Consulting.- 5.5 DeclaringOperators.- 6 Built-in Predicates.- Definition of the “core” built-in predicates, with sensible examples of how each one is used. By this point, the reader should be able to read reasonably complex programs, and should therefore be able to absorb the built-in predicates by seeing them in use.- 6.1 EnteringNew Clauses.- 6.2 Success and Failure.- 6.3 Classifying Terms.- 6.4 Treating Clauses as Terms.- 6.5 Constructing and Accessing Components of Structures.- 6.6 Affecting Backtracking.- 6.7 Constructing Compound Goals.- 6.8 Equality.- 6.9 Input and Output.- 6.10 Handling Files.- 6.11 Evaluating Arithmetic Expressions.- 6.12 Comparing Terms.- 6.13 Watching Prolog atWork.- 7 More Example Programs.- Many example programs are given, covering a wide range of interests. Examples include list processing, set operations, symbolic differentiation and simplification of formula.- 7.1 A Sorted Tree Dictionary.- 7.2 Searching a Maze.- 7.3 The Towers of Hanoi.- 7.4 Parts Inventory.- 7.5 List Processing.- 7.6 Representing andManipulating Sets.- 7.7 Sorting.- 7.8 Using the Database.- 7.8.1 Random.- 7.8.2 Gensym.- 7.8.3 Findall.- 7.9 SearchingGraphs.- 7.10 Sift the Two’s and Sift the Three’s.- 7.11 Symbolic Differentiation.- 7.12 Mapping Structures and Transforming Trees.- 7.13 Manipulating Programs.- 7.14 Bibliographic Notes.- 8 Debugging Prolog Programs.- By this point, the reader will be able to write reasonable programs, and so the problem of debugging will be relevant. Flow of control model, hints about common bugs, techniques of debugging..- 8.1 Laying out Programs.- 8.2 Common Errors.- 8.3 The Tracing Model.- 8.4 Tracing and Spy Points.- 8.4.1 Examining the Goal.- 8.4.2 Examining the Ancestors.- 8.4.3 Altering the Degree of Tracing.- 8.4.4 Altering the Satisfaction of the Goal.- 8.4.5 Other Options.- 8.4.6 Summary.- 8.5 Fixing Bugs.- 9 Using Prolog Grammar Rules.- Applications of existing techniques. Using Grammar Rules. Examining the design decisions for some aspects of analysing natural language with Grammar Rules.- 9.1 The Parsing Problem.- 9.2 Representing the Parsing Problemin Prolog.- 9.3 The Grammar Rule Notation.- 9.4 Adding ExtraArguments.- 9.5 Adding Extra Tests.- 9.6 Summary.- 9.7 Translating Language into Logic.- 9.8 More General Use of Grammar Rules.- 10 The Relation of Prolog to Logic.- Predicate Calculus, clausal form, resolution theorem proving, logic programming.- 10.1 Brief Introduction to Predicate Calculus.- 10.2 Clausal Form.- 10.3 A Notation for Clauses.- 10.4 Resolution and Proving Theorems.- 10.5 Horn Clauses.- 10.6 Prolog.- 10.7 Prolog and Logic Programming.- 11 Projects in Prolog.- A selection of suggested exercises, projects and problems.- 11.1 Easier Projects.- 11.2 Advanced Projects.- A Answers to Selected Exercises.- B Clausal Form Program Listings.- C Writing Portable Standard Prolog Programs.- The Prolog standard, writing portable programs and dealing with different Prolog implementations.- C.1 Standard Prolog for Portability.- C.2 Different Prolog Implementations.- C.3 Issues to LookOut For.- C.4 Definitions of some Standard Predicates.- C.4.1 Character Processing.- C.4.2 Directives.- C.4.3 Stream Input/Output.- C.4.4 Miscellaneous.- D CodetoSupport DCGs.- D.1 DCG Support Code.

Read more less

Book SynopsisGegenstand dieses Werkes sind die Theorie und Praxis der modernen funktionalen Programmierung. Dabei betrachten die Autoren aber nicht nur das, was mittels der heute implementierten Sprachen wie HASKELL, OPAL, ML usw. machbar ist, sondern weisen auch auf aktuelle Entwicklungen hin. Zum einen werden fortgeschrittene Programmiertechniken vorgestellt, wie z.B. die Verwendung unendlicher Datenstrukturen, Parser als Funktionen höherer Ordnung, Approximations-Algorithmen, Lösung von Gleichungssystemen usw. Zum anderen werden aber auch Sprachkonzepte diskutiert, wie z.B. eine systematische Form der Modularisierung oder besonders ausdrucksstarke und flexible Formen der Typisierung. Ein besonderes Gewicht wird generell auf die Integration verschiedener Paradigmen gelegt, wie etwa die Verbindung mit Konzepten der objektorientierten, der nebenläufigen oder der Constraint-basierten Programmierung. In diesem Zusammenhang wird speziell auch die Bedeutung von Monaden analysiert und kritisch hinterfragt.Trade ReviewAus den Rezensionen: "Bei diesem Titel … werden … fortgeschrittene Leser angesprochen, die mit den Grundlagen der funktionalen Programmierung vertraut sind. … ‘Im Vordergrund stehen Ideen und Konzepte einer eleganten, sicheren und produktiven Form des Programmierens‘, wobei der Blick in die Zukunft gerichtet ist und Konzepte und Methoden vorgestellt werden, die erst in den Sprachen der nächsten Generation verfügbar sein werden. Geeignet für Bibliotheken … an Hochschulstandorten … Das Lehrbuch kann noch weiter genutzt werden." (Isigkeit, in: ekz-Informationsdienst, 2006)Table of ContentsElementare Funktionale Programmierung Eine Wiederholung.- Das Strittigste vorab: Notationen.- Grundlagen der Funktionalen Programmierung.- Faulheit währt unendlich.- Parser als Funktionen höherer Ordnung.- Strukturierung von Programmen.- Gruppen: Die Basis der Modularisierung.- Operatoren auf Gruppen (Morphismen).- Die Idee der Typisierung.- Typen.- Subtypen (Vererbung).- Polymorphe und abhängige Typen.- Spezifikationen und Typklassen: Wie Typen typisiert werden.- Beispiel: Berechnung von Fixpunkten.- Beispiel: Monaden.- Datenstrukturen.- Netter stack und böse Queue.- Compilertechniken für funktionale Datenstrukturen.- Funktionale Arrays und Numerische Mathematik.- Map: Wenn Funktionen zu Daten werden.- Beispiel: Synthese von Programmen.- Integration von Paradigmen.- Zeit und Zustand in der funktionalen Welt.- Objekte und Ein-/Ausgabe.- Agenten und Prozesse.- Graphische Schnittstellen (GUIs).- Massiv parallele Programme.- Integration von Konzepten anderer Programmierparadigmen.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the First International Conference on Fundamental Approaches to Software Engineering, FASE'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, held in Lisbon, Portugal, in March/April 1998.Besides two invited presentations and three system demonstrations, this volume presents 18 revised full papers selected from a total of 59 submissions. Among the various fundamental software engineering issues addressed are formal methods, specification languages, refinement, object-oriented modeling, software architectures, statecharts, model checking, etc.Table of ContentsExtreme programming: A humanistic discipline of software development.- Some mistakes I have and what I have learned from them.- Specifying and analyzing dynamic software architectures.- Observational proofs with critical contexts.- Integrating AORTA with model-based data specification languages.- Specifying safety-critical embedded systems with statecharts and Z: A case study.- Specifying embedded systems with statecharts and Z: An agenda for cyclic software components.- Algebra transformation systems and their composition.- Navigation expressions in object-oriented modelling.- Compositional verification of reactive systems specified by graph transformation.- Reflections on the design of a specification language.- Constructs, concepts and criteria for reuse in concurrent object-oriented languages.- Backtracking-free design planning by automatic synthesis in metaframe.- Model-checking CSP-Z.- Rule-based refinement of high-level nets preserving safety properties.- Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms.- Behaviour analysis and safety conditions: A case study in CML.- Distributed safety controllers for web services.- A refinement calculus for statecharts.- Refining formal specifications of human computer interaction by graph rewrite rules.- RELVIEW — A system for calculating with relations and relational programming.- ALBERT: A formal language and its supporting tools for requirements engineering.- Moby/plc — A design tool for hierarchical real-time automata.

Read more less

Book SynopsisObject-Process Methodology (OPM) is an intuitive approach to systems engineering. This book presents the theory and practice of OPM with examples from various industry segments and engineering disciplines, as well as daily life. OPM is a generic, domain independent approach that is applicable almost anywhere in systems engineering.Table of ContentsI Foundations of Object-Process Methodology.- 1 A Taste of OPM.- 1.1 The Wedding Example: A Sneak Preview of OPM.- 1.2 OPM Building Blocks: Objects, Processes, and States.- 1.3 Specialization and Inheritance.- 1.4 Aggregation and the Result Link.- Summary.- Problems.- 2 Object-Process Diagrams.- 2.1 Objects and Aggregation.- 2.2 Structural Relations and Structural Links.- 2.3 Processes and Procedural Links.- 2.4 System Diagram: The Top-Level OPD.- 2.5 Zooming into the Transaction Executing Process.- 2.6 The OPD Set.- 2.7 How to Read an OPD.- 2.7.1 Flow of Control.- 2.7.2 The Timeline in OPDs.- 2.7.3 Object States and Conditions.- 2.8 Completing the In-Zoomed Transaction Executing OPD.- 2.8.1 Logical XOR, AND, and OR Operators.- 2.8.2 The System Map.- 2.8.3 The Ultimate OPD.- 2.8.4 Zooming Out of Transaction Executing.- Summary.- Problems.- 3 Object-Process Language.- 3.1 Motivation for a Language.- 3.1.1 Real-Time Textual Feedback.- 3.1.2 Closing the Requirements-Implementation Gap.- 3.2 Structural Links and Structure Sentences.- 3.2.1 The First OPL Sentence.- 3.2.2 The First OPL Aggregation Sentence.- 3.3 The OPL Paragraph and the Graphics-Text Principle.- 3.3.1 Extending the OPL Paragraph.- 3.3.2 Enabling Sentences.- 3.3.3 Transformation Sentences.- 3.3.4 The SD Paragraph.- 3.4 More OPL Sentence Types.- 3.4.1 State Enumeration and Condition Sentences.- 3.4.2 AND, XOR, and OR Logical Operators.- 3.4.3 The SD1 Paragraph.- 3.4.4 In-Zooming and Out-Zooming Sentences.- 3.5 Boolean Objects and Determination Sentence.- 3.5.1 Boolean Condition Sentences.- 3.5.2 Compound Condition Sentences.- 3.5.3 State-Specified Generation Sentence.- 3.5.4 Converting a Dual-State Object into a Boolean Object.- 3.6 OPD-OPL Item Pairs and Synergy.- Summary.- Problems.- 4 Objects and Processes.- 4.1 Existence, Things, and Transformations.- 4.1.1 Objects.- 4.1.2 Transformation and Processes.- 4.2 Processes and Time.- 4.2.1 Cause and Effect.- 4.2.2 Syntactic vs. Semantic Sentence Analysis.- 4.2.3 The Process Test.- 4.3 Things.- 4.3.1 Things and Entities.- 4.3.2 The Perseverance of Things.- 4.3.3 The Essence of Things.- 4.3.4 Symbolizing Physical Things.- 4.3.5 The Origin of Things.- 4.3.6 The Complexity of Things.- 4.3.7 Thing Types.- 4.3.8 The Relativity of Object and Process Importance.- 4.3.9 Object and Process Naming.- 4.4 Informatical Objects.- 4.4.1 Telling Informatical and Physical Objects Apart.- 4.4.2 Systems and Information Systems.- 4.4.3 Translation of Informatical Objects.- 4.4.4 Toward “Pure” Informatical Objects.- 4.5 Object Identity.- 4.5.1 Change of State or Change of Identity?.- 4.5.2 Classes and Instances of Objects and Processes.- Summary.- Problems.- II Concepts of OPM Systems Modeling.- 5Dynamics.- 5.1 States.- 5.1.1 Object States and Status.- 5.1.2 Change and Effect.- 5.1.3 Explicit and Implicit Status Representations.- 5.1.4 The Input, Output, and Effect Links.- 5.1.5 State Suppression and the Effect Link.- 5.1.6 State Expression.- 5.2 Existence and Transformation.- 5.2.1 Result and Consumption Links.- 5.2.2 Procedural Links, Enablers, and Transformées.- 5.2.3 Enablers.- 5.2.4 Agents.- 5.2.5 Instruments.- 5.2.6 Enabling Links.- 5.2.7 Transformées.- 5.2.8 Odd Man Out: The Invocation Linkt.- 5.3 Object Roles with Respect to a Process.- 5.3.1 Enablers and Affectees.- 5.3.2 The Involved, Preprocess, and Postprocess Object Sets.- 5.3.3 Condition and Agent Condition Links.- 5.3.4 Operator, Operand, and Transform?.- Summary.- Problems.- 6Structure.- 6.1 Structural Relations.- 6.1.1 Structural Links.- 6.1.2 Structural Relation Directions.- 6.1.3 Unidirectional Structural Link.- 6.1.4 OPD Sentences.- 6.1.5 The Reciprocity of a Structural Relation.- 6.1.6 Null Tags and Their Default OPL Reserved Phrases.- 6.1.7 Structural Relations as Static Verbs.- 6.2 Participation Constraints and Cardinality.- 6.2.1 Participation Constraints.- 6.2.2 Parameterized Participation Constraints.- 6.2.3 Range Participation Constraints.- 6.2.4 Shorthand Notations and Reserved Phrases.- 6.2.5 Cardinality.- 6.2.6 Participation Constraints in Procedural Relations.- 6.3 The Distributive Law and Forks.- 6.3.1 Forks.- 6.3.2 Fork Degree.- 6.3.3 Fork Comprehensiveness.- 6.4 The Transitivity of Structural Relations.- 6.5 The Four Fundamental Structural Relations.- Summary.- Problems.- 7Aggregation and Exhibition.- 7.1 Aggregation-Participation: Underlying Concepts.- 7.1.1 Aggregation-Participation as a Tagged Structural Relation.- 7.1.2 The Aggregation-Participation Symbol.- 7.1.3 Sets and Order.- 7.1.4 Aggregate Naming.- 7.1.5 Aggregating Processes.- 7.2 Aggregation Hierarchy and Comprehensiveness.- 7.2.1 Aggregation Hierarchy.- 7.2.2 Aggregation Comprehensiveness.- 7.2.3 Parameterized Participation Constraints.- 7.2.4 Participation Level and Aggregational Complexity.- 7.3 Exhibition-Characterization: Underlying Concepts.- 7.3.1 The Name Exhibition-Characterization.- 7.3.2 The Exhibition-Characterization Symbol.- 7.3.3 Attribute and Operation Are Features.- 7.3.4 Exhibition Complexity.- 7.4 Features in 00 vs. OPM.- 7.5 The Four Thing-Feature Combinations.- 7.5.1 The Object-Attribute Combination.- 7.5.2 The Object-Operation Combination.- 7.5.3 The Process-Attribute Combination.- 7.5.4 Process-Operation Combination.- 7.6 The Feature Hierarchy.- 7.7 Feature-Related Natural Language Issues.- 7.7.1 Attribute Naming Dilemmas.- 7.7.2 Reserved Objects and the Measurement Unit Reserved Object.- 7.7.3 Continuous Values and Multi-Valued Attributes.- 7.7.4 Mathematical Inequalities in OPM.- 7.8 Reflective Metamodeling of an Attribute.- 7.8.1 The Size of an Attribute.- 7.8.2 The Mode of an Attribute.- 7.8.3 The Touch of an Attribute.- 7.8.4 The Source of a Feature.- 7.8.5 The Operation a Feature Carries.- Summary.- Problems.- 8 Generalization and Instantiation.- 8.1 Generalization-Specialization: Introduction.- 8.1.1 Specialization Symbol and Sentence.- 8.1.2 Process Specialization.- 8.2 Inheritance.- 8.2.1 Feature Inheritance.- 8.2.2 Structural Relations Inheritance.- 8.2.3 Procedural Link Inheritance.- 8.2.4 State Inheritance.- 8.2.5 State Specialization.- 8.2.6 Process Specialization.- 8.2.7 Generalization Complexity.- 8.3 Qualification.- 8.3.1 Qualification Inheritance.- 8.3.2 Multiple Qualification Inheritance.- 8.4 Classification-Instantiation.- 8.4.1 Classes and Instances.- 8.4.2 The Relation Between Instantiation and Specialization.- 8.4.3 The Relativity of Instance.- 8.4.4 Instance Qualification.- 8.4.5 Process Instances.- 8.4.6 Classification Complexity.- 8.5 Modifiers and Instances.- 8.5.1 Natural Language Modifiers and Shortcuts.- 8.5.2 Adjectives and Attributes.- 8.5.3 Adverbs and Operations.- 8.6 Specializations of the Involved Object Set Members.- 8.7 Non-Comprehensiveness.- 8.7.1 Non-Comprehensiveness of Fundamental Structural Relations.- 8.7.2 Non-Comprehensiveness of States and Values.- Summary.- Problems.- 9 Managing Systems’ Complexity.- 9.1 The Need for Complexity Management.- 9.1.1 Middle-Out as the De-Facto Architecting Practice.- 9.1.2 Determining the Extent of Refinement.- 9.1.3 Towards Quantifying Complexity.- 9.2 Divide and Conquer: By Aspects or by Details?.- 9.2.1 Why is Detail Decomposition Good?.- 9.2.2 When Should a New OPD Be Created?.- 9.3 The Attributes of Scaling.- 9.3.1 The Purpose of Scaling.- 9.3.2 The Mode of Scaling.- 9.3.3 Controlling Visibility by In- and Out-Zooming.- 9.3.4 The Distributivity of Procedural Links.- 9.3.5 Unfolding and Folding.- 9.3.6 State Expressing and Suppressing.- 9.3.7 Primary and Secondary Operands.- 9.4 Abstracting.- 9.4.1 Consolidating.- 9.4.2 Zoom consolidating.- 9.4.3 Paths and Path Labels.- 9.4.4 Zoom Consolidating Pitfalls.- 9.4.5 Zoom Consolidating Conditions.- 9.4.6 Fold Consolidating.- 9.5 What Happens to Procedural Links During Abstracting?.- 9.5.1 Procedural Link Precedence.- 9.5.2 Semi-Folding and Semi-Unfolding.- 9.5.3 Selective Semi-Folding and Semi-Unfolding.- 9.6 Looking at the Big Picture: The System Map and the OPM Construct Pairs.- Summary.- Problems.- III Building Systems with OPM.- 10 Systems and Modeling.- 10.1 Defining Systems.- 10.1.1 Some Existing Definitions.- 10.1.2 Function.- 10.1.3 The Various Functions of Stone.- 10.2 System Defined.- 10.2.1 System as a Relative Term.- 10.2.2 System as a Subjective Term.- 10.2.3 The Function of Naturaland Artificial Systems.- 10.3 Goal, Concept, and Function.- 10.3.1 The Intent and Goal of Artificial Systems.- 10.3.2 Telling System Function and Dynamics Apart.- 10.3.3 Function, Structure, and Behavior.- 10.4 System Architecture.- 10.4.1 Function vs. Dynamics.- 10.4.2 The Concept Behind a System.- 10.4.3 The Origin and Essence of Systems.- 10.5 Objects, Systems, and Products.- 10.5.1 Product Defined.- 10.5.2 The Object-System-Product Hierarchy.- 10.5.3 Goods, Services, and Projects.- 10.6 Documenting Functions of the System Architecture.- 10.6.1 The Function Hierarchy.- 10.6.2 Function Boxes and Function Sentences.- 10.6.3 Functionality.- 10.7 From Systems to Models.- 10.7.1 Some Model Definitions.- 10.7.2 Model Defined.- 10.8 Modeling Paradigms.- 10.8.1 Natural Language as a Modeling Tool.- 10.8.2 Mathematical and Symbolic Modeling.- 10.8.3 Graphic Modeling and Knowledge Representation.- 10.9 Reflective Metamodeling.- Summary.- Problems.- 11 System Lifecycle and Evolution.- 11.1 System Lifecycle.- 11.1.1 Lifecycle of Artificial Systems.- 11.1.2 Software and Product Development Processes.- 11.2 Systems Analysis and the Scientific Method.- 11.3 Categorization vs. Interdisciplinarity.- 11.4 System Engineering and the Role of the System Architect.- 11.5 An OPM Model of System Lifecycle Phases.- 11.5.1 Top-Level Description of System Evolution.- 11.5.2 Initiating the System.- 11.5.3 Developing the System.- 11.5.4 Analyzing.- 11.5.5 The Refining-Abstracting Cycles.- 11.5.6 Designing.- 11.5.7 The Waterfall Model vs. Iterative and Incremental Development.- 11.5.8 Deploying the System.- 11.6 Zooming into Analyzing.- 11.7 Zooming into Designing and Implementing.- 11.8 From Design to Implementation.- Summary.- Problems.- 12 States and Values.- 12.1 State-specified Objects and Links.- 12.1.1 Initial, Ultimate and Default States.- 12.1.2 The Transformation Attribute of a Process.- 12.1.3 Object as a Role Player for State.- 12.1.4 State Maintaining Processes.- 12.1.5 Sentences and Phrases of States and Values.- 12.1.6 Single Value Sentence.- 12.2 Telling States Apart from Values.- 12.3 Metamodeling the Attributes of Value and Their States.- 12.3.1 Numeric and Symbolic Values.- 12.3.2 Mapping Object States onto Attribute Values.- 12.4 Compound States and State Space.- 12.4.1 The Attribute Feasibility Matrix.- 12.4.2 Logical Compound States.- Summary.- Problems.- 13 Advanced OPM Concepts.- 13.1 Real-Time Issues.- 13.1.1 Sequential vs. Parallel Process Execution.- 13.1.2 Process Synchronization.- 13.1.3 Events.- 13.1.4 Chronon and Event.- 13.1.5 Basic Triggering Event Types.- 13.2 Process and State Duration.- 13.3 Processing states.- 13.4 Probability in Procedural Relations.- 13.5 Scope and Name Disambiguation.- 13.5.1 The Fundamental DAG.- 13.5.2 Scope of an Object.- 13.6 The Reserved Words “of” and “which”.- 13.6.1 The Reserved Word “of” and the Dot Operator.- 13.6.2 Using “of” with Tagged Structural Relations.- 13.6.3 The Reserved Word “which”.- 13.6.4 Operation: A Process Without Side Effect.- 13.7 Structure-Related Issues.- 13.7.1 Transitivity Strength.- 13.7.2 Hamiltonian Distance.- 13.7.3 The Fractal Relation.- 13.7.4 Covariance and Contravariance.- 13.8 OPM Metamodeling Issues.- 13.8.1 AMetamodelofThing.- 13.8.2 The Specialization-Specification Hierarchy.- 13.8.3 A Refined Generic Processing Model.- 13.8.4 Time Exception Handling.- 13.9 The OPM Construct Hierarchy.- Summary.- Problems.- 14 Systems Theory.- 14.1 The Informatics Hierarchy.- 14.1.1 Computers Are Climbing the Informatics Hierarchy.- 14.1.2 Knowledge and Understanding.- 14.2 Ontology.- 14.3 General Systems Theory.- 14.3.1 A Brief History of General Systems Theory.- 14.3.2 The Hierarchy of System Levels.- 14.4 Autopoietic vs. Allopoietic Systems.- 14.5 Systems and Humans.- 14.6 Systems Theory Characteristics.- 14.6.1 Previously Defined Characteristics.- 14.6.2 System, Environment and Beneficiaries.- 14.6.3 Control and Feedback.- 14.7 Classical Physics vs. Quantum Theory.- 14.7.1 Visualization.- 14.7.2 Causality.- 14.7.3 Locality.- 14.7.4 Self-Identity.- 14.7.5 Objectivity.- 14.8 Objectifying: Converting a Process into an Object.- Summary.- Problems.- 15 Object-Oriented Modeling.- 15.1 The Evolution of System Analysis Methods.- 15.1.1 Data Flow Diagrams.- 15.1.2 Entity-Relationship Diagrams and Their Combination with DFD.- 15.1.3 The Object-Oriented Paradigm.- 15.2 Pre-UML Object-Oriented Methods.- 15.2.1 Object Modeling Technique.- 15.2.2 Object-Oriented Software Engineering.- 15.2.3 Object-Oriented Analysis and Object-Oriented Design.- 15.2.4 Object-Oriented Systems Analysis.- 15.2.5 Object-Oriented Analysis & Design.- 15.2.6 Object Life-Cycles.- 15.2.7 The Booch Method.- 15.2.8 MOSES.- 15.2.9 The Fusion Method.- 15.2.10 OPEN Modeling Language.- 15.3 Unified Modeling Language-UML.- 15.4 Metamodeling in OO Methods.- 15.5 OO Methods - A Summary.- 15.6 Software Development Approaches and Trends.- 15.6.1 Aspect-Oriented Programming.- 15.6.2 The Rational Unified Process.- 15.6.3 Extreme Programming.- 15.6.4 Agile Modeling.- 15.7 Challenges for OO Methods.- 15.7.1 A Historic Perspective.- 15.7.2 The Encapsulation Challenge.- 15.7.3 The Model Multiplicity Challenge.- 15.7.4 Empirical Evidence of the Model Multiplicity Problem.- 15.7.5 The Complexity Management Challenge.- 15.8 OPM and OO.- 15.8.1 The UML 2.0 Initiative.- 15.8.2 Systemantica: an OPM Supporting Tool.- 15.8.3 OPM Applications and Research: Present and Future.- Summary.- Problems.- Appendix A: The ATM System.- References.

Read more less

Book Synopsis Get started with Vue.js quickly and easily with this book This book provides a compact and practical introduction to the popular Vue.js. Use the MVVC concept for applications on the web on the basis of MVC design patterns and create single-page web applications easily. You will use one of the powerful frameworks based only on elementary WWW standard technologies. With Vue.js you will understand and apply data binding, components, directives and modularity. With this book, you will not only learn the most important basics of Vue.js. You will also learn how to create and maintain web applications with this JavaScript web framework. The focus of this comprehensive work is on the following aspects: - HTML/CSS/JavaScript and the Web: The Vue.js environment - Basis of JavaScript (above all JSON) - Working with the Vue instance - templates - Double Curly Syntax and Data Binding With its strong application focus, this book on Vue.js is an ideal companion for self-study or relevant courses. In terms of content, it is aimed at: (a) creators of websites (b) programmers c) Web designer Dive even deeper into the matter Ralph Steyer shows which prerequisites you should have to work with this book. Then you will learn more about the framework and the special features of Vue.js. In the further course, the author covers these partial aspects, among others: - First examples - just test Vue.js once - How and why does Vue.js work? - Conditional Rendering: The v-if directive - making decisions - Dynamic layouts with data binding - making stylesheets dynamic - Forms and form data binding - interaction with the user - Transitions and animations - Moving things If you want to learn even more about the application, this book gives you an outlook on further possible uses and functions of Vue.js in the final chapter. To make it easier for you to get started, you will find program codes and illustrations in each chapter that illustrate complex processes.Table of ContentsIntroduction - Before we really get started - First examples - Just testing Vue js - Behind the scenes - How and why does Vue js work? - Vue js in depth - The Vue instance, Vue templates and data binding - Working with arrays - Iterations with the v-for directive - Conditional rendering - The v-if directive - Making decisions - Events, methods, Observers and Calculated Properties - Calculated Results and Responses - Dynamic Layouts with Data Binding - Making Stylesheets Dynamic - Forms and Form Data Binding - Interacting with the User - Filtering Techniques - Selected Data Only - Transitions and Animations - Moving Things - Looking Ahead - What Else is in Vue js?

Read more less

Book SynopsisUsing everyday examples, you will first learn the basic concepts of programming, which are similar in all programming languages.

Read more less