Chapter 0 Preface — Programming Languages (original) (raw)

• -1.1. How to Use this System

Chapter 1 Grammars¶

• -1.1. Derivations and Parse Trees
  • -1.1.1. Parse Trees
    * -1.1.1.1. First Sample Grammar
  • -1.1.2. Strings Generated by a Grammar
  • -1.1.3. Characterizing a Language: Example 1
  • -1.1.4. Characterizing a Language: Example 2
• -1.2. Ambiguous Grammars
  • -1.2.1. Second Sample Grammar
  • -1.2.2. Ambiguity in Grammars
  • -1.2.3. Ambiguous Grammar - Part 1
  • -1.2.4. Ambiguous Grammar - Part 2
  • -1.2.5. Ambiguous Grammar - Part 3
  • -1.2.6. Discovering Ambiguity
• -1.3. Enforcing Order of Operations
  • -1.3.1. Evaluation of Expressions
    * -1.3.1.1. Third Sample Grammar
  • -1.3.2. Expression Evaluation
  • -1.3.3. Associativity
  • -1.3.4. Precedence and Associativity
  • -1.3.5. Characterizing a Language Given a BNF Grammar
  • -1.3.6. Extended BNF
• -1.4. Parser Generators
  • -1.4.1. Jison
  • -1.4.2. More practice with Jison
• -1.5. Using Parser Generators to Interpret a Language
  • -1.5.1. Annotating Jison Grammars

Chapter 2 Functional Programming¶

• -1.1. List Construction and Deconstruction
  • -1.1.1. Constructing Lists with fp.cons
  • -1.1.2. Deconstructing Lists with fp.hd and fp.tl
  • -1.1.3. Practicing List Manipulations with the fp module
  • -1.1.4. fp.isNull, fp.isEq, and fp.isZero
• -1.2. Developing Basic, Recursive List-processing Functions
  • -1.2.1. Recursive List Processing Example: sum( list )
  • -1.2.2. Recursive List Processing Example: isMember( num, list )
  • -1.2.3. Recursive List Processing Example: subst( new, old, list )
• -1.3. Recurring On Lists That Aren’t Flat
  • -1.3.1. Deep Recursion in FP
  • -1.3.2. Deep Recursion on Binary Search Trees
  • -1.3.3. Practice with Deep Recursion
  • -1.3.4. More Practice with Deep Recursion
• -1.4. Using Helper Functions with Accumulators
  • -1.4.1. Using Helpers to Write reverse and split Functions
  • -1.4.2. Using the split Function to Develop a Sorting Function
  • -1.4.3. Additional Practice with the Accumulator Pattern
• -1.5. Scope, Closures, Higher-order Functions, Static vs. Dynamic Binding
  • -1.5.1. Scope, Closures, Higher-order Functions
  • -1.5.2. Practice with Higher-order Functions and Anonymous Functions
  • -1.5.3. More Practice with Higher-order Functions and Anonymous Functions
  • -1.5.4. Practice with Static vs. Dynamic Binding Rules
• -1.6. Procedural Abstraction: Map, Curry, and Compose
  • -1.6.1. The Mapping Pattern
  • -1.6.2. Function Composition
  • -1.6.3. Currying
  • -1.6.4. More currying
• -1.7. Procedural Abstraction: The Filtering and Folding (or Reduce) Patterns
  • -1.7.1. The Filtering Pattern
  • -1.7.2. The Folding/Reduce Pattern
  • -1.7.3. Practice with the Mapping and Reduce Patterns
  • -1.7.4. More Practice with the Reduce Pattern
• -1.8. Combining Map and Reduce
  • -1.8.1. The MapReduce Paradigm
• -1.9. Continuations and Continuation Passing
  • -1.9.1. Tail recursive functions
  • -1.9.2. Continuation-Passing Style
  • -1.9.3. Continuation-Passing Style Practice Problem (Part 1)
  • -1.9.4. Continuation-Passing Style Practice Problem (Part 2)
  • -1.9.5. Continuation-Passing Style Practice Problem (Part 3)
  • -1.9.6. More CPS Practice

Chapter 3 Lambda Calculus¶

• -1.1. Syntax of the Lambda Calculus
  • -1.1.1. Lambda Calculus
  • -1.1.2. Practice with Lambda Calculus Syntax
  • -1.1.3. More Practice with Lambda Calculus Syntax
• -1.2. Semantics of the Lambda Calculus
  • -1.2.1. Semantics of the Lambda Calculus
  • -1.2.2. Practice with Lambda Calculus Semantics
• -1.3. Free and Bound Variables
  • -1.3.1. Free and Bound Variables
  • -1.3.2. Identifying Free Variables
  • -1.3.3. Identifying Bound Variables
  • -1.3.4. Formal Definition of Free Variables
• -1.4. Alpha-Conversion
  • -1.4.1. Alpha-Conversion Rule
  • -1.4.2. Practice with Alpha Conversion
• -1.5. The Substitution-Based Model of Evaluation
  • -1.5.1. Substitution Algorithm
  • -1.5.2. Identifying Substitution Subcases of Case 1
  • -1.5.3. Identifying Substitution Subcases of Case 2
  • -1.5.4. Identifying Substitution Case 3
  • -1.5.5. Identifying Substitution Cases and Subcases
  • -1.5.6. Performing the Substitution Algorithm
• -1.6. Beta-Reduction
  • -1.6.1. Beta-Redexes
  • -1.6.2. Identifying Beta-Redexes
  • -1.6.3. Beta-Reduction is a Substitution
  • -1.6.4. Some Beta-Reductions Require Alpha-Conversion
  • -1.6.5. Performing Beta-Reductions
• -1.7. Reduction Strategies
  • -1.7.1. Applicative Order
  • -1.7.2. Normal Order
  • -1.7.3. Beta-Reduction Order (1)
  • -1.7.4. Beta-Reduction Order (2)
  • -1.7.5. Applicative Order Proficiency Exercise
  • -1.7.6. Normal Order Proficiency Exercise
• -1.8. Church Numerals and Booleans
  • -1.8.1. Church Booleans
  • -1.8.2. Encoding If-Then-Else
  • -1.8.3. Encoding OR
  • -1.8.4. Church Numerals
  • -1.8.5. Church Numerals with Addition and Multiplication
• -1.9. Recursive Functions
  • -1.9.1. Fixed-points of Functions
  • -1.9.2. The Y Fixed-point Combinator
  • -1.9.3. Using Y to Implement Factorial
  • -1.9.4. Identifying Fixed Point Combinators

Chapter 4 Interpreting the Functional Language SLang 1¶

• -1.1. Defining SLang 1
  • -1.1.1. Syntax of SLang 1
  • -1.1.2. Concrete Syntax of SLang 1
  • -1.1.3. More Practice with the Concrete Syntax of SLang 1
  • -1.1.4. Abstract Syntax of SLang 1
  • -1.1.5. Curry in SLang 1
  • -1.1.6. Semantics of SLang 1
• -1.2. Environment-based Model of Evaluation
  • -1.2.1. Environment Data Structure
  • -1.2.2. Determining Values Bound to a Variable
  • -1.2.3. Evaluation of Expression Within an Environment
  • -1.2.4. Determining Denoted Values in SLang 1
• -1.3. Let Expressions
  • -1.3.1. Let Blocks
  • -1.3.2. Let Blocks As Syntactic Sugar
  • -1.3.3. Nested Lets
  • -1.3.4. Nested Lets with Closures

Chapter 5 Interpreting the Imperative Language SLang 2¶

• -1.1. Defining SLang 2
  • -1.1.1. SLang 2: An Imperative Language
  • -1.1.2. Output of SLang 2 Program
• -1.2. Tying The Knot
  • -1.2.1. Implementing Recursion Efficiently
  • -1.2.2. Practice TTK

Chapter 6 Variations on Parameter Passing¶

• -1.1. Parameter-Passing Mechanisms
  • -1.1.1. Call By Value vs. Call By Reference
  • -1.1.2. Copy-Restore
  • -1.1.3. Macro Expansion
  • -1.1.4. Call By Name
  • -1.1.5. Comprehensive Review of the Five Methods Studied So Far
• -1.2. Lazy Lists
  • -1.2.1. Infinite Sequences
  • -1.2.2. Practice With Infinite Sequences
  • -1.2.3. Practice With Infinite Sequences (2)
  • -1.2.4. Practice With Infinite Sequences (3)

Chapter 7 Type Systems¶

• -1.1. Types in Programming Languages
  • -1.1.1. Motivating Examples
  • -1.1.2. Type System: Definition
  • -1.1.3. Type System: Static Versus Dynamic
  • -1.1.4. Type System: Safe Versus Unsafe
  • -1.1.5. Type System: Strong Versus Weak
  • -1.1.6. Type System: Typed Variables or Values
  • -1.1.7. Type System: Explicit Versus Implicit typing
  • -1.1.8. The Many Uses of Type Systems
• -1.2. Type Inference
  • -1.2.1. Type Environments
  • -1.2.2. Typing Rules Expressed as Post Systems
  • -1.2.3. Typing in a Scaled-down ML
  • -1.2.4. Using Post System Rules to Describe Type Inferencing in ML
  • -1.2.5. Parametric Polymorphism in ML
  • -1.2.6. Type inferencing in ML
  • -1.2.7. Type Inferencing Problem 1
  • -1.2.8. Type Inferencing Problem 2
  • -1.2.9. Type Inferencing Problem 3
  • -1.2.10. Type Inferencing Problem 4
  • -1.2.11. Type Inferencing Problem 5
  • -1.2.12. Type Inferencing Problem 6

Chapter 8 Appendices¶

• -1.1. GLOSSARY

• Index

• Search Page