Practical Foundations for Programming Languages



Download free course Practical Foundations for Programming Languages, pdf file on 590 pages by Robert Harper.
Types are the central organizing principle of the theory of programming languages. Language features are manifestations of type structure. The syntax of a language is governed by the constructs that define its types, and its semantics is determined by the interactions among those constructs. The soundness of a language design - the absence of ill-defined programs-follows naturally. The purpose of this book is to explain this remark. A variety of programming language features are analyzed in the unifying framework of type theory. A language feature is defined by its statics, the rules governing the use of the feature in a program, and its dynamics, the rules defining how programs using this feature are to be executed. The concept of safety emerges as the coherence of the statics and the dynamics of a language.

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
File type : PDF
Downloads: 139
Created: 2022-02-03
License: CC BY-NC-ND
Author(s): Robert Harper
Practical Foundations for Programming Languages

Warning: Trying to access array offset on false in /home/tutovnfz/public_html/article.php on line 233

Others programming Tutorials

Certified Programming with Dependent Types

Programming for Computations - Python, 2nd Edition

C Programming for Arduino

Programming Computer Vision with Python

Object-oriented Programming in C#

Others related eBooks about Practical Foundations for Programming Languages

Essential Swift

This book written to provide clear and concise explanation of topics for programmers both starting to learn the Swift programming language as well as those diving in more complex topics. Most examples are linked to online playground that allows you to change the code and re-run it....

Graph Algorithms

Download free course Graph Algorithms, pdf file on 257 pages by Mark Needham, Amy Hodler....

Getting started with C#

Free tutorial in PDF about C# programming ,a training document under 52 pages designated to beginners who want to learn the basics of CSharp language....

Tutorial XML in PDF

Download free XML tutorial course in PDF, training file in 8 chapters and 25 pages. Free unaffiliated ebook created from Stack OverFlow contributor....

Artificial Neural Networks - Methodological Advances and Biomedical Applications

Artificial Neural Networks (ANN) may probably be the single most successful technology in the last two decades which has been widely used in a large variety of applications in various areas. The purpose of this book is to provide recent advances of artificial neural networks in biomedical applicat...

XcalableMP PGAS Programming Language

Download free course XcalableMP PGAS Programming Language, pdf file on 265 pages by Mitsuhisa Sato....

Download Perl language tutorial

Download free Perl tutorial course in PDF, training file in 40 chapters and 141 pages. Free unaffiliated ebook created from Stack OverFlow contributor....

Ruby Regexp

Download free course Ruby Regexp, pdf file on 72 pages by Sundeep Agarwal....

React JS tutorial

Download free React JS tutorial course in PDF, training file in 31 chapters and 110 pages. Free unaffiliated ebook created from Stack OverFlow contributor....

Data Mining and Analysis: Fundamental Concepts and Algorithms

The fundamental algorithms in data mining and analysis form the basis for the emerging field of data science, which includes automated methods to analyze patterns and models for all kinds of data, with applications ranging from scientific discovery to business intelligence and analytics. ...