Introduction to the Theory of Programming Languages

Front Cover
Springer Science & Business Media, Dec 9, 2010 - Computers - 96 pages
The design and implementation of programming languages, from Fortran and Cobol to Caml and Java, has been one of the key developments in the management of ever more complex computerized systems. Introduction to the Theory of Programming Languages gives the reader the means to discover the tools to think, design, and implement these languages. It proposes a unified vision of the different formalisms that permit definition of a programming language: small steps operational semantics, big steps operational semantics, and denotational semantics, emphasising that all seek to define a relation between three objects: a program, an input value, and an output value. These formalisms are illustrated by presenting the semantics of some typical features of programming languages: functions, recursivity, assignments, records, objects, ... showing that the study of programming languages does not consist of studying languages one after another, but is organized around the features that are present in these various languages. The study of these features leads to the development of evaluators, interpreters and compilers, and also type inference algorithms, for small languages.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Terms and Relations
1
The Language PCF
15
From Evaluation to Interpretation
32
Compilation
43
PCF with Types
51
Type Inference
63
References and Assignment
73
Records and Objects
81
Epilogue
89
References
92
Index
93
Copyright

Other editions - View all

Common terms and phrases

About the author (2010)

Gilles Dowek is a Professor at ╔cole Polytechnique. He is also a Researcher at the Laboratoire d'Informatique de l'╔cole Polytechnique and the Institut National de Recherche en Informatique et en Automatique (INRIA). His research concerns the formalization of mathematics and the mechanization of reasoning. His main contribution is a reformulation of the axiomatic method which provides a central role to the notion of computation. Jean-Jacques LÚvy is a senior scientist at the Institut National de Recherche en Informatique et en Automatique and a Professor at ╔cole Polytechnique. He has successively worked on operational and denotational semantics of programming languages, on reduction strategies in lambda-calculus and in rewrite systems, on the computer aided design of circuits and on the semantics of concurrency with applications to distribution and mobility.

Bibliographic information