Modern Programming Languages : A Practical Introduction

by WEBBER ADAM BROOKS

• ISBN13: 9781887902762
• ISBN10: 1887902767
• Additional ISBN(s): 9781590282502
• Format: Paperback
• Copyright: 2002-10-01
• Publisher: Franklin Beedle & Assoc
• More Book Details
• Purchase Benefits

Summary

Typical undergraduate CS/CE majors have a practical orientation: they study computing because they like programming and are good at it. This book has strong appeal to this core student group. There is more than enough material for a semester-long course. The challenge for a course in programming language concepts is to help practical students understand programming languages at an unaccustomed level of abstraction. To help meet this challenge, the book includes enough hands-on programming exercises and examples to motivate students whose primary interest in computing is practical

Table of Contents

Preface	p. xv
Acknowledgments	p. xix
Programming Languages	p. 1
The Amazing Variety	p. 2
The Odd Controversies	p. 5
The Intriguing Evolution	p. 6
The Many Connections	p. 7
A Word about Application Programming Interfaces	p. 8
Defining Program Syntax	p. 10
A Grammar Example for English	p. 11
A Grammar Example for a Programming Language	p. 12
A Definition of Grammars: Backus-Naur Form	p. 13
Writing Grammars	p. 15
Lexical Structure and Phrase Structure	p. 17
Other Grammar Forms	p. 19
Where Syntax Meets Semantics	p. 26
Operators	p. 28
Precedence	p. 29
Associativity	p. 31
Other Ambiguities	p. 34
Cluttered Grammars	p. 36
Parse Trees and EBNF	p. 37
Abstract Syntax Trees	p. 38
Language Systems	p. 42
The Classical Sequence	p. 42
Variations on the Classical Sequence	p. 48
Binding Times	p. 55
Debuggers	p. 57
Runtime Support	p. 58
A First Look at ML	p. 65
Getting Started with an ML Language System	p. 66
Constants	p. 67
Operators	p. 68
Conditional Expressions	p. 70
Type Conversion and Function Application	p. 71
Variable Definition	p. 73
Garbage Collection	p. 74
Tuples and Lists	p. 74
Function Definitions	p. 78
ML Types and Type Annotations	p. 81
Types	p. 86
A Menagerie of Types	p. 87
Uses for Types	p. 97
A Second Look at ML	p. 103
Patterns You Already Know	p. 103
More Simple Patterns	p. 104
Complex Patterns	p. 105
A Summary of ML Patterns So Far	p. 106
Using Multiple Patterns for Functions	p. 106
Pattern-Matching Style	p. 107
Local Variable Definitions	p. 110
Nested Function Definitions	p. 114
Polymorphism	p. 118
Overloading	p. 119
Parameter Coercion	p. 122
Parametric Polymorphism	p. 124
Subtype Polymorphism	p. 126
A Third Look at ML	p. 133
More Pattern Matching	p. 134
Function Values and Anonymous Functions	p. 135
Higher-Order Functions and Currying	p. 138
Predefined Higher-Order Functions	p. 140
Scope	p. 148
Definitions and Scope	p. 149
Scoping with Blocks	p. 151
Scoping with Labeled Namespaces	p. 154
Scoping with Primitive Namespaces	p. 157
Dynamic Scoping	p. 159
A Word about Separate Compilation	p. 161
A Fourth Look at ML	p. 165
Enumerations	p. 166
Data Constructors with Parameters	p. 167
Type Constructors with Parameters	p. 169
Recursively-Defined Type Constructors	p. 171
Memory Locations for Variables	p. 181
Activation-Specific Variables	p. 182
Activation Records	p. 184
Static Allocation of Activation Records	p. 185
Dynamic Stacks of Activation Records	p. 186
Handling Nested Function Definitions	p. 194
Functions as Parameters	p. 199
Long-Lived Functions	p. 202
A First Look at Java	p. 207
Thinking about Objects	p. 208
Simple Expressions and Statements	p. 210
Class Definitions	p. 226
About References and Pointers	p. 231
Getting Started with a Java Language System	p. 233
Memory Management	p. 239
A Memory Model Using Java Arrays	p. 240
Stacks	p. 242
Heaps	p. 246
Current Heap Links	p. 259
A Second Look at Java	p. 273
Implementing Interfaces	p. 273
Extending Classes	p. 278
Extending and Implementing	p. 284
Multiple Inheritance and How to Live without It	p. 285
Generics and How to Live without Them	p. 287
Object Orientation	p. 299
Object-Oriented Programming	p. 300
A Menagerie of Object-Oriented Language Features	p. 308
A Third Look at Java	p. 320
Throwable Classes	p. 321
Catching Exceptions	p. 323
Throwing Exceptions	p. 328
Checked Exceptions	p. 331
Error Handling	p. 334
Finally	p. 344
Parameters	p. 359
Correspondence	p. 360
By Value	p. 361
By Result	p. 364
By Value-Result	p. 367
By Reference	p. 369
By Macro Expansion	p. 375
By Name	p. 377
By Need	p. 379
Specification Issues	p. 381
A First Look at Prolog	p. 386
The Building Blocks--Prolog Terms	p. 387
Getting Started with a Prolog Language System	p. 389
Rules	p. 393
The Two Faces of Prolog	p. 397
A Word about Term Interpretation	p. 399
Operators	p. 399
Lists	p. 401
Negation and Failure	p. 409
What Prolog Is Good For	p. 411
A Second Look at Prolog	p. 418
Unification	p. 419
A Procedural View	p. 422
An Implementational View	p. 425
An Abstract View--Proof Trees	p. 429
The Lighter Side of Prolog	p. 435
Cost Models	p. 449
A Cost Model for Lists	p. 450
A Cost Model for Function Calls	p. 455
A Cost Model for Prolog Search	p. 463
A Cost Model for Arrays	p. 464
Spurious Cost Models	p. 469
A Third Look at Prolog	p. 475
Numeric Computation	p. 475
Problem Space Search	p. 482
Formal Semantics	p. 497
Language One	p. 498
Language Two--Adding Variables	p. 503
Language Three--Adding Functions	p. 508
Other Kinds of Formal Semantics	p. 515
The History of Programming Languages	p. 525
The Prehistory of Programming	p. 525
Early Programming Languages	p. 529
This Book's Languages	p. 544
Postscript	p. 554
Index	p. 555
Table of Contents provided by Syndetics. All Rights Reserved.