In this way we establish a foundation for the study of programming languages. But why these particular methods? The main justification is provided by the book itself. The methods we use are both precise and intuitive, providing a uniform framework for explaining programming language concepts. Importantly, these methods scale to a wide range of programming language concepts, supporting rigorous analysis of their properties. Although it would require another book in itself to justify this assertion, these methods are also practical in that they are directly applicable to implementation and uniquely effective as a basis for mechanized reasoning. No other framework offers as much.
Table of contents
- Judgments and Rules
- Syntactic Objects
- Inductive Definitions
- Hypothetical and General Judgments
- Statics and Dynamics
- Statics
- Dynamics
- Type Safety
- Evaluation Dynamics
- Function Types
- Function Definitions and Values
- Godel's T
- Plotkin's PCF
- Finite Data Types
- Product Types
- Sum Types
- Pattern Matching
- Generic Programming
- Infinite Data Types
- Inductive and Co-Inductive Types
- Recursive Types
- Dynamic Types
- The Untyped -Calculus
- Dynamic Typing
- Hybrid Typing
- Variable Types
- Girard's System F
- Abstract Types
- Constructors and Kinds
- Subtyping
- Subtyping
- Singleton Kinds
- Classes and Methods
- Dynamic Dispatch
- Inheritance
- Exceptions and Continuations
- Control Stacks
- Exceptions
- Continuations
- Types and Propositions
- Constructive Logic
- Classical Logic
- Symbols
- Symbols
- Fluid Binding
- Dynamic Classification
- State
- Modernized Algol
- Assignable References
- Laziness
- Lazy Evaluation
- Polarization
- Parallelism
- Nested Parallelism
- Futures and Speculations
- Concurrency
- Process Calculus
- Concurrent Algol
- Distributed Algol
- Modularity
- Components and Linking
- Type Abstractions and Type Classes
- Hierarchy and Parameterization
- Equational Reasoning
- Equational Reasoning for T
- Equational Reasoning for PCF
- Parametricity
- Process Equivalence
- Appendices
- Finite Sets and Finite Functions
| Pages : | 590 |
| Size : | 3.0 MB |
| Downloads: | 224 |
| Created: | 2022-02-03 |
| License: | CC BY-NC-ND |
| Author(s): | Robert Harper |
Others related eBooks about Practical Foundations for Programming Languages
Mathematica is a feature-rich, high-level programming language which has historically been used by engineers. This book unpacks Mathematica for programmers, building insights into programming style via real world syntax, real world examples, and extensive parallels to other languages.
Download free course Programming Persistent Memory, pdf file on 438 pages by Steve Scargall.
This programming fundamentals tutorial in PDF format covers the key concepts and principles that are essential for anyone looking to become a proficient coder. The tutorial begins with an introduction to programming, explaining the basic concepts and terminologies that underlie all programming langu
This book to provides a complete and coherent review of the theory of Genetic Programming (GP)). This unique overview of this exciting technique is written by three of the most active scientists in GP.
Download free course Programming Windows Store Apps with HTML, CSS, and JavaScript, pdf file on 1311 pages by Kraig Brockschmidt.