Bansal, Arvind Kumar. <br/><br/>
Introduction to programming languages/ 
Arvind Kumar Bansal 
 - Boca Raton:  CRC press,  2014. 
 - xxxv, 588 p. :  ill. ;  26 cm. 
<br/><br/> "Chapman & Hall book." 
<br/><br/>Includes bibliographical references (pages 557-566) and index. 
<br/><br/>Chapter 1 ■ Introduction<br/>1.1 MULTITUDE OF PROBLEM DOMAINS<br/>1.2 MOTIVATION<br/>1.3 LEARNING OUTCOMES<br/>1.4 PROGRAM AND COMPONENTS<br/>1.4.1 Abstractions in Programs<br/>1.4.2 Program Comprehension and Jumps<br/>1.4.3 Execution of Programs<br/>1.5 INTEROPERABILITY OF PROGRAMMING LANGUAGES<br/>1.6 SOFTWARE DEVELOPMENT CYCLE<br/>1.7 CRITERIA FOR A GOOD PROGRAMMING LANGUAGE<br/>1.8 HISTORY OF PROGRAMMING PARADIGMS AND LANGUAGES<br/>1.8.1 Imperative Programming Paradigm<br/>1.8.2 Declarative Programming Paradigm<br/>1.8.3 Object-Oriented Programming Paradigm<br/>1.8.4 Concurrent Programming Paradigm<br/>1.8.5 Visual Programming Paradigm<br/>1.8.6 Multimedia Programming Paradigm<br/>1.8.7 Web-Based Programming Paradigm<br/>1.8.8 Event-Based Programming Paradigm<br/>1.8.9 Integration of Programming Paradigms<br/>1.9 CLASSIFICATION OF LANGUAGES<br/>1.9.1 Programming Paradigms-Based Classification<br/>1.9.2 Implementation-Based Classification<br/>1.9.3 Other Classifications<br/>1.10 SUMMARY<br/>1.11 ASSESSMENT<br/>1.11.1 Concepts and Definitions<br/>1.11.2 Problem Solving<br/>1.11.3 Extended Response<br/>FURTHER READING<br/>Chapter 2 ■ Background and Fundamental Concepts<br/>2.1 VON NEUMANN MACHINE<br/>2.1.1 Address Mechanisms<br/>2.2 DISCRETE STRUCTURES CONCEPTS<br/>2.2.1 Set Operations<br/>2.2.2 Boolean Logic and Predicate Calculus<br/>2.2.3 Recursion<br/>2.2.4 Finite State Machines<br/>2.3 DATA STRUCTURE CONCEPTS<br/>2.3.1 Sequences<br/>2.3.2 Stacks and Queues<br/>2.3.3 Reference Mechanisms<br/>2.3.4 Recursive Data Structures<br/>2.3.5 Trees<br/>2.3.6 Graphs<br/>2.3.7 Exhaustive Search<br/>2.3.8 Mapping Data Structures in Linear Memory<br/>2.3.9 Hash Tables<br/>2.4 ABSTRACT CONCEPTS IN COMPUTATION<br/>2.4.1 Mutable versus Immutable Variables<br/>2.4.2 Bindings and Scope Rules<br/>2.4.3 Types of Variables<br/>2.4.4 Environment and Store<br/>2.4.5 Functions and Procedures<br/>2.4.6 Abstracting the Program Execution<br/>2.4.7 Processes and Threads<br/>2.4.8 Buffers<br/>2.5 SUMMARY<br/>2.6 ASSESSMENT<br/>2.6.1 Concepts and Definitions<br/>2.6.2 Problem Solving<br/>2.6.3 Extended Response<br/>FURTHER READING<br/>Chapter 3 ■ Syntax and Semantics<br/>3.1 INTRODUCTION TO SYNTAX AND SEMANTICS<br/>3.2 GRAMMARS<br/>3.2.1 Types of Grammars<br/>3.2.2 Representing Grammar Using Backus-Naur Form<br/>3.2.3 Extended Backus-Naur Form (EBNF)<br/>3.2.4 Attribute Grammar<br/>3.2.5 Hyper-Rules and Meta-Definitions<br/>3.2.6 Abstract Syntax<br/>3.3 SYNTAX DIAGRAMS<br/>3.3.1 Translating Syntax Rules to Syntax Diagrams<br/>3.3.2 Translating Syntax Diagrams to Syntax Rules<br/>3.4 VALIDATING SENTENCE STRUCTURE<br/>3.4.1 Lexical Analysis<br/>3.4.2 Parsing<br/>3.4.3 Handling Grammar Ambiguities<br/>3.4.4 Abstract Syntax Tree<br/>3.4.5 Automated Parsing<br/>3.5 SEMANTICS<br/>3.5.1 Operational Semantics<br/>3.5.2 Axiomatic Semantics<br/>3.5.3 Denotational Semantics<br/>3.5.4 Action Semantics<br/>3.5.5 Other Models of Semantics<br/>3.6 SUMMARY 115<br/>3.7 ASSESSMENT<br/>3.7.1 Concepts and Definitions<br/>3.7.2 Problem Solving<br/>3.7.3 Extended Response<br/>FURTHER READING<br/>Chapter 4 ■ Abstractions in Programs and Information Exchange<br/>4.1 DATA ABSTRACTIONS<br/>4.1.1 Single Data Entities<br/>4.1.2 Composite Data Entities<br/>4.1.3 Collection of Data Entities<br/>4.1.4 Extensible Data Entities<br/>4.1.5 Ordering and Accessing Data Entities<br/>4.1.6 Interconnected Data Entities<br/>4.1.7 Persistence<br/>4.1.8 Declarations and Environment Change<br/>4.2 CONTROL ABSTRACTIONS<br/>4.2.1 Assignment and Command Sequence<br/>4.2.2 Conditional Statements<br/>4.2.3 Iterative Constructs and Iterators<br/>4.2.4 Block Structure<br/>4.2.5 Program Units and Invocations<br/>4.2.6 Modules<br/>4.2.7 Objects and Classes<br/>4.3 INFORMATION EXCHANGE<br/>4.3.1 Mechanisms of Information Exchange<br/>4.4 PARAMETER PASSING<br/>4.4.1 Call-by-Value and Variations<br/>4.4.2 Call-by-Reference and Variations<br/>4.4.3 Call-by-Result<br/>4.4.4 Call-by-Value-Result<br/>4.4.5 Call-by-Name<br/>4.4.6 Call-by-Need<br/>4.4.7 Passing Subprograms as Parameters<br/>4.4.8 Parameter Passing for Distributed Computing<br/>4.5 SIDE EFFECTS<br/>4.5.1 Aliasing and Side Effects<br/>4.5.2 Regulating Side Effects<br/>4.5.3 A Comprehensive Example<br/>4.6 EXCEPTION HANDLING<br/>4.7 NONDETERMINISTIC COMPUTATION<br/>4.7.1 Guarded Commands<br/>4.7.2 Stepwise Program Construction<br/>4.8 PROGRAMS AS DATA<br/>4.8.1 Functions as First-Class Objects<br/>4.8.2 Meta-Programming and Reflexivity<br/>4.9 SOFTWARE REUSE<br/>4.9.1 Interoperability Revisited<br/>4.10 CASE STUDY<br/>4.10.1 Data Abstraction in Programming Languages<br/>4.10.2 Control Abstractions in Programming Languages<br/>4.10.3 Information Exchange in Programming Languages<br/>4.11 SUMMARY<br/>4.12 ASSESSMENT<br/>4.12.1 Concepts and Definitions<br/>4.12.2 Problem Solving<br/>4.12.3 Extended Response<br/>FURTHER READING<br/>Chapter 5 ■ Implementation Models for Imperative Languages<br/>5?i ABSTRACT COMPUTING MACHINE<br/>5.2 TRANSLATING CONTROL ABSTRACTIONS<br/>5.2.1 Translating Expressions<br/>5.2.2 Translating Assignment Statement<br/>5.2.3 Translating If-Then-Else Construct<br/>5.2.4 Translating Case Statement<br/>5.2.5 Translating Iterative Constructs<br/>5.3 STATIC ALLOCATION<br/>5.4 HYBRID ALLOCATION<br/>5.4.1 Roles of Various Pointers<br/>5.4.2 Calling Subprograms<br/>5.4.3 Generating Data and Code Areas<br/>5.5 IMPLEMENTING PARAMETER PASSING<br/>5.5.1 Implementing Call-by-Value<br/>5.5.2 Implementing Call-by-Reference<br/>5.5.3 Implementing Call-by-Value-Result<br/>5.6 LOW-LEVEL BEHAVIOR OF RECURSIVE PROCEDURES<br/>5.7 IMPLEMENTING EXCEPTION HANDLER<br/>5.8 SUMMARY<br/>5.9 ASSESSMENT<br/>5.9.1 Concepts and Definitions<br/>5.9.2 Problem Solving<br/>5.9.3 Extended Response<br/>FURTHER READING<br/>Chapter 6 ■ Dynamic Memory Management<br/>6.1 HEAP ORGANIZATION<br/>6.2 ALLOCATION OF DYNAMIC DATA OBJECTS<br/>6.3 DEALLOCATION OF DYNAMIC DATA OBJECTS<br/>6.4 FRAGMENTATION<br/>6.5 GARBAGE COLLECTION—RECYCLING HEAP MEMORY<br/>6.5.1 Garbage Collection Approaches<br/>6.6 START-AND-STOP GARBAGE COLLECTION<br/>6.6.1 Mark-and-Scan Algorithm<br/>6.6.2 Copying Garbage Collection<br/>6.6.3 Cheney's Modified Copying Garbage Collection<br/>6.6.4 Generational Garbage Collection<br/>6.7 INCREMENTAL GARBAGE COLLECTION<br/>6.7.1 Baker's Algorithm<br/>6.8 CONTINUOUS REFERENCE-COUNT GARBAGE COLLECTION<br/>6.9 CONCURRENT GARBAGE COLLECTION<br/>6.9.1 Concurrent Copying Garbage Collection<br/>6.9.2 Concurrent Real-Time Garbage Collection<br/>6.10 ISSUES IN GARBAGE COLLECTION<br/>6.11 SUMMARY<br/>6.12 ASSESSMENT<br/>6.12.1 Concepts and Definitions<br/>6.12.2 Problem Solving<br/>6.12.3 Conceptual Type<br/>FURTHER READING<br/>Chapter 7 ■ Type Theory<br/>7.1 ADVANTAGES OF TYPE DECLARATION<br/>7.2 NOTION OF TYPE<br/>7.2.1 Basic Data Types<br/>7.3 SET OPERATIONS AND STRUCTURED TYPES<br/>7.3.1 Ordinal Types<br/>7.3.2 Cartesian Product and Tuples<br/>7.3.3 Finite Mapping and Arrays<br/>7.3.4 Pov^er Set and Set Constructs<br/>7.3.5 Disjoint Union and Variant Record<br/>7.3.6 Set Operations for Recursive Data Types<br/>7.4 LIMITATIONS OF TYPE THEORY<br/>7.5 POLYMORPHISM<br/>7.5.1 Parametric Polymorphism<br/>7.5.2 Inclusion Polymorphism and Subtypes<br/>7.5.3 Overloading<br/>7.5.4 Coercion<br/>7.6 TYPE SYSTEM IN MODERN PROGRAMMING LANGUAGES<br/>7.6.1 Universal Reference Type<br/>7.7 TYPE EQUIVALENCE<br/>7.7.1 Structure versus Name Equivalence<br/>7.8 IMPLEMENTATION OF TYPES<br/>7.8.1 Type Inference and Checking<br/>7.8.2 Implementing Polymorphic Type Languages<br/>7.9 CASE STUDY<br/>7.9.1 Type System in Ada<br/>7.9.2 Type System in C++<br/>7.9.3 Type System in Modula-3<br/>7.10 SUMMARY<br/>7.11 ASSESSMENT<br/>7.11.1 Concepts and Definitions<br/>7.11.2 Problem Solving<br/>7.11.3 Extended Response<br/>FURTHER READING<br/>Chapter 8 ■ Concurrent Programming Paradigm<br/>8.1 CONCURRENT EXECUTION AND ABSTRACTIONS<br/>8.1.1 Race Conditions<br/>8.1.2 Threads and Dependencies<br/>8.1.3 Synchronization and Mutual Exclusion<br/>8.1.4 Sequential Consistency<br/>8.2 PROGRAM DEPENDENCY AND AUTOMATIC<br/>PARALLELIZATION<br/>8.2.1 Control Dependency<br/>8.2.2 Data Dependency<br/>8.2.3 Program-Dependency Graph<br/>8.2.4 Parallelization Techniques<br/>8.2.5 Granularity and Execution Efficiency<br/>8.2.6 Program Slicing<br/>8.3 TASK AND DATA PARALLELISM<br/>8.3.1 Task Parallelism<br/>8.3.2 Data Parallelism<br/>8.3.3 Integrating Task and Data Parallelism<br/>8.4 DISTRIBUTED COMPUTING<br/>8.4.1 Executing Remote Procedures<br/>8.4.2 Parameter Passing in Remote Procedure Calls<br/>8.5 COMMUNICATING SEQUENTIAL PROCESSES<br/>8.5.1 CSP Algebra<br/>8.5.2 Communicating Sequential Process Language<br/>8.6 MEMORY MODELS FOR CONCURRENCY<br/>8.6.1 Memory Model of C-H-l- •<br/>8.7 CONCURRENT PROGRAMMING CONSTRUCTS<br/>8.7.1 Coroutines<br/>8.7.2 Cobegin-Coend<br/>8.7.3 Fork-and-Join<br/>8.7.4 Monitors<br/>8.8 CASE STUDY<br/>8.8.1 Concurrent Programming in Ada<br/>8.8.2 Concurrent Programming in Java<br/>8.8.3 Distributed Computing in Emerald<br/>8.9 SUMMARY<br/>8.10 ASSESSMENT<br/>8.10.1 Concepts and Definitions<br/>8.10.2 Problem Solving<br/>8.10.3 Extended Response<br/>FURTHER READING<br/>Chapter 9 ■ Functional Programming Paradigm<br/>9.1 EXPRESSIONS<br/>9.2 EVALUATION OF X-EXPRESSIONS<br/>9.2.1 Applicative-Order versus Normal-Order Reductions<br/>9.3 FPS—FUNCTIONAL PROGRAMMING SYSTEMS<br/>9.3.1 Kernel Functions<br/>9.3.2 Functional-Forms for Constructing Complex Functions<br/>9.3.3 Programming in FPS<br/>9.3.4 Comparing X-Expressions and FPS<br/>9.4 ABSTRACTIONS AND PROGRAMMING<br/>9.4.1 Abstractions in Functional Programming Languages<br/>9.4.2 Abstractions and Programming in the Lisp Family<br/>9.4.3 Abstractions and Programming in Hope<br/>9.4.4 Abstractions and Programming in Haskell<br/>9.4.5 Abstractions and Functional Programming in Scala<br/>9.4.6 Abstractions and Functional Programming in Ruby<br/>9.5 IMPLEMENTATION MODELS FOR FUNCTIONAL<br/>LANGUAGES<br/>9.5.1 SECD Machine and Eager Evaluation<br/>9.5.2 Graph-Reduction Strategies<br/>9.5.3 Implementing Lazy Evaluation<br/>9.6 INTEGRATION WITH OTHER PROGRAMMING<br/>PARADIGMS<br/>9.6.1 Concurrency in Functional Languages<br/>9.7 SUMMARY<br/>9.8 ASSESSMENT<br/>9.8.1 Concepts and Definitions<br/>9.8.2 Problem Solving<br/>9.8.3 Conceptual Type<br/>FURTHER READING<br/>Chapter 10 ■ Logic Programming Paradigm<br/>10.1 LOGIC PROGRAMMING FUNDAMENTALS<br/>10.1.1 Facts and Rules<br/>10.1.2 Forward and Backward Reasoning Systems<br/>10.1.3 Data Representation<br/>10.1.4 Unification—Bidirectional Information Flow<br/>10.1.5 Representing Logic Programs<br/>10.1.6 Properties of Logic Programs<br/>10.2 ABSTRACT IMPLEMENTATION MODEL<br/>10.2.1 Query Reduction<br/>10.2.2 Mapping Query Reduction to AND-OR Tree<br/>10.2.3 Backtracking<br/>10.2.4 Warren Abstract Machine<br/>10.2.5 Program Analysis<br/>10.3 PROGRAMMING USING PROLOG<br/>10.3.1 Cuts—Programmer-Directed Efficiency<br/>10.3.2 Programming with Sets<br/>10.3.3 Nondeterministic Programming<br/>10.3.4 Abstractions and Meta-Programming<br/>10.3.5 Limitations of Prolog<br/>10.4 EXTENDING LOGIC PROGRAMMING PARADIGM<br/>10.4.1 Temporal Logic Programming<br/>10.4.2 Constraint Logic Programming<br/>10.4.3 Inductive Logic Programming<br/>10.4.4 Higher-Order Logic Programming<br/>10.5 INTEGRATION WITH OTHER PARADIGMS<br/>10.5.1 Integration with Functional Programming<br/>10.5.2 Integration with Object-Oriented<br/>Programming<br/>10.5.3 Concurrent Logic Programming<br/>10.6 SUMMARY<br/>10.7 ASSESSMENT<br/>10.7.1 Concepts and Definitions<br/>10.7.2 Problem Solving<br/>10.7.3 Extended Response<br/>FURTHER READING<br/>Chapter 11 ■ Object-Oriented Programming Paradigm<br/>11.1 CLASSES AND OBJECTS<br/>11.1.1 Object—An Instance of a Class<br/>11.2 CLASS-HIERARCHY AND INHERITANCE<br/>11.2.1 Subclasses<br/>11.2.2 Virtual Methods<br/>11.2.3 Multiple-Inheritance<br/>11.3 VISIBILITY AND INFORMATION EXCHANGE<br/>11.3.1 Visibility of Member Entities<br/>11.3.2 Encapsulation<br/>11.3.3 Information Exchange<br/>11.4 POLYMORPHISM AND TYPE CONVERSION<br/>11.4.1 Parametric Polymorphism and Generic<br/>Templates<br/>11.4.2 Casting<br/>11.4.3 Subclass versus Subtyping<br/>11.5 CASE STUDIES<br/>11.5.1 Abstractions and Programming in C-j-P<br/>11.5.2 Abstractions and Programming in Java<br/>11.5.3 Abstractions and Programming in Scala<br/>11.5.4 Abstractions and Programming in Ruby<br/>11.6 IMPLEMENTATION OF OBJECT-ORIENTED LANGUAGES<br/>11.6.1 Storage Allocation and Deallocation<br/>11.6.2 Implementing Casting<br/>11.6.3 Implementing Multiple-Inheritance<br/>11.6.4 Implementing Virtual Entities and Methods<br/>11.6.5 Overhead Issues and Optimizations<br/>11.6.6 Run-Time Behavior<br/>11.7 DISTRIBUTED OBJECT-ORIENTED MODELS<br/>11.7.1 Distributed Objects in Emerald<br/>11.7.2 Distributed Objects in Java<br/>11.7.3 Remote Method Invocation<br/>11.7.4 RMI-Based Programming<br/>11.8 SUMMARY<br/>11.9 ASSESSMENT<br/>11.9.1 Concepts and Definitions<br/>11.9.2 Problem-Solving<br/>11.9.3 Extended Response<br/>FURTHER READING<br/>Chapter 12 ■ Web and Multimedia Programming Paradigms<br/>12.1 CODE AND DATA MOBILITY<br/>12.1.1 Issues in Mobile Computing<br/>12.2 WEB-BASED PROGRAMMING<br/>12.2.1 HTML<br/>12.2.2 XML as Middleware Interface Language<br/>12.2.3 Web Scripting<br/>12.2.4 Applets<br/>12.2.5 Security in Web Programming<br/>12.3 VIRTUAL MACHINES AND RUN-TIME INTERFACE<br/>12.3.1 Java Virtual Machine<br/>12.3.2 Just-in-Time Compilation<br/>12.4 COMPONENTS OF MULTIMEDIA SYSTEMS<br/>12.4.1 Representation and Transmission<br/>12.4.2 Perceptual Distortion<br/>12.4.3 Synchronization in Multimedia<br/>12.5 MULTIMEDIA PROGRAMMING CONSTRUCTS<br/>12.5.1 Synchronization Constructs<br/>12.6 CASE STUDY<br/>12.6.1 Abstractions and Programming in Alice<br/>12.6.2 Abstractions and Programming in SMIL<br/>12.6.3 Abstractions and Web Programming in Javascript<br/>12.6.4 Abstractions and Web Programming in C#<br/>12.7 SUMMARY<br/>12.8 ASSESSMENT<br/>12.8.1 Concepts and Definitions<br/>12.8.2 Problem Solving<br/>12.8.3 Extended Response<br/>FURTHER READING<br/>Chapter 13 ■ Other Programming Paradigms<br/>13.1 EVENT-BASED PROGRAMMING<br/>13.1.1 Event Model<br/>13.1.2 Developing an Event-Based Program<br/>13.2 AGENT-BASED PROGRAMMING<br/>13.2.1 Components of an Agent-Based System<br/>13.2.2 Agent Security<br/>13.2.3 Fault Tolerance in Multi-Agent Systems<br/>13.3 HIGH PRODUCTIVITY MASSIVE PARALLEL PROGRAMMING<br/>13.3.1 Partitioned Global Address Space<br/>13.3.2 Constructs for High-Productivity Computing<br/>13.4 SYNCHRONOUS LANGUAGES<br/>13.4.1 Synchronous Constructs in Estrel<br/>13.5 SUMMARY<br/>13.6 ASSESSMENT<br/>13.6.1 Concepts and Definitions<br/>13.6.2 Problem Solving<br/>13.6.3 Extended Response<br/>FURTHER READING<br/>Chapter 14 ■ Scripting Languages<br/>14.1 COMPONENTS OF SCRIPTING LANGUAGES<br/>14.1.1 Shell-Based Programming<br/>14.1.2 Data-Driven Programming<br/>14.1.3 Command Scripts<br/>14.1.4 Text and String Processing<br/>14.2 ABSTRACTIONS IN SCRIPTING LANGUAGES<br/>14.2.1 Control and Data Abstractions<br/>14.2.2 Shell Variables<br/>14.2.3 Type Conversions<br/>14.2.4 Regular Expressions and Pattern Matching<br/>14.2.5 Programming Example<br/>14.3 CASE STUDY<br/>14.3.1 Abstractions and Programming in Perl<br/>14.3.2 Abstractions in PHP<br/>14.3.3 Abstractions and Programming in Python<br/>14.3.4 Script Programming in Prolog<br/>14.3.5 Script Programming in Ruby<br/>14.3.6 Other Scripting Languages<br/>14.4 SUMMARY<br/>14.5 ASSESSMENT<br/>14.5.1 Concepts and Definitions<br/>14.5.2 Problem Solving<br/>14.5.3 Extended Response<br/>FURTHER READING<br/>Chapter 15 ■ Conclusion and Future of Programming Languages<br/>15.1 EVOLUTION OF PROGRAMMING PARADIGMS AND<br/>LANGUAGES<br/>15.2 EVOLUTION OF IMPLEMENTATION MODELS AND<br/>COMPILERS<br/>15.3 CONSTRUCT DESIGN AND COMPREHENSION<br/>15.4 FUTURE DEVELOPMENT OF PROGRAMMING LANGUAGES<br/>FURTHER READING 
<br/><br/><label>ISBN: </label>9781466565142 1466565144 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Programming Languages (Electronic computers)<br/>Computer Programming<br/>Computer Programming.<br/>Programming Languages (Electronic computers)<br/>Programmierparadigma.<br/>Programmiersprache.
<br/><br/><label>Dewey Class. No.: </label>005.1  / BAN/I