NU Learning Resource Center OPAC catalog › Details for: Introduction to the theory of programming languages /

Normal view MARC view ISBD view

Introduction to the theory of programming languages / Gilles Dowek and Jean-Jacques Lévy.

By: Dowek, Gilles [author]Contributor(s): Lévy, Jean-Jacques [co-author]Material type: Text

TextSeries: Undergraduate topics in computer sciencePublication details: New York : Springer, c2011Description: xi, 96 pages : illustrations ; 24 cmISBN: 9780857290755Subject(s): PROGRAMMING LANGUAGES (ELECTRONIC COMPUTERS) | PROGRAMMING LANGUAGES (ELECTRONIC COMPUTERS) -- SEMANTICSLOC classification: QA 76.7 .D69 2011

Contents:

Terms and relations -- The language PCF -- From evaluation to interpretation -- Compilation -- PCF with types -- Type inference -- References and assignment -- Records and objects.

Summary: 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.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 3 )
Comments ( 0 )

Item type	Current library	Home library	Collection	Shelving location	Call number	Copy number	Status	Date due	Barcode
Books	LRC - Main	National University - Manila	Computer Science	General Circulation	GC QA 76.7 .D69 2011 (Browse shelf (Opens below))	c.1	Available		NULIB000009628

Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)

Previous								Next
Previous	GC QA 76.6 .K58 2011 vol.4a c.2 The art of computer programming : combinatorial algorithms, part I /	GC QA 76.6 .S55 2014 Introduction to computational science : modeling and simulation for the sciences /	GC QA 76.6 .S78 2013 Understanding computation	GC QA 76.7 .D69 2011 Introduction to the theory of programming languages /	GC QA 76.7 .F37 1995 Computer programming logic using flowcharts /	GC QA 76.7 .F45 1990 Using ANSI C in UNIX /	GC QA 76.7 .F67 1990 Computer programming languages : a comparative introduction /	Next

Includes bibliographical references and index.

Terms and relations --
The language PCF --
From evaluation to interpretation --
Compilation --
PCF with types --
Type inference --
References and assignment --
Records and objects.

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.

There are no comments on this title.

to post a comment.