Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Introduction to the Theory of Programming Languages

Introduction to the Theory of Programming Languages

Dowek, Gilles, Lévy, Jean-Jacques

2011, XI, 118p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$29.95

(net) price for USA

ISBN 978-0-85729-076-2

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$39.95

(net) price for USA

ISBN 978-0-85729-075-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Gives the reader the means to discover the tools to invent, design, and implement programming languages
  • Proposes a unified vision of the different formalisms that permit definition of a programming language
  • Presents a synthesis of what all computer scientists, whatever their speciality, should know
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.

Content Level » Graduate

Keywords » Assignments - Big Step Operational Semantics - Compiler - Denotational Semantics - Evaluator - Function - Interpreter - Objects - Records - Recursion - Small Step Operational Semantics - Type Inference

Related subjects » Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.