Introduction to the Theory of Programming Languages / by Gilles Dowek, Jean-Jacques Lévy.

Springer eBooks

1. Terms and Relations -- 2. The Language PCF -- 3. From Evaluation to Interpretation -- 4. Compilation -- 5. PCF with Types -- 6. Type Inference -- 7. References and Assignment -- 8. Records and Objects -- 9. Epilogue -- 10. Index -- 11. Bibliography.

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.