Cantitate/Preț
Produs

Theories of Programming Languages

Autor John C. Reynolds
en Limba Engleză Paperback – apr 2009
First published in 1998, this textbook is a broad but rigourous survey of the theoretical basis for the design, definition and implementation of programming languages and of systems for specifying and proving programme behaviour. Both imperative and functional programming are covered, as well as the ways of integrating these aspects into more general languages. Recognising a unity of technique beneath the diversity of research in programming languages, the author presents an integrated treatment of the basic principles of the subject. He identifies the relatively small number of concepts, such as compositional semantics, binding structure, domains, transition systems and inference rules, that serve as the foundation of the field. Assuming only knowledge of elementary programming and mathematics, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory and also will appeal to researchers and professionals in designing or implementing computer languages.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 42916 lei  6-8 săpt.
  Cambridge University Press – apr 2009 42916 lei  6-8 săpt.
Hardback (1) 48298 lei  6-8 săpt.
  Cambridge University Press – 12 oct 1998 48298 lei  6-8 săpt.

Preț: 42916 lei

Preț vechi: 53645 lei
-20% Nou

Puncte Express: 644

Preț estimativ în valută:
8216 8902$ 6861£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521106979
ISBN-10: 0521106974
Pagini: 516
Dimensiuni: 170 x 244 x 26 mm
Greutate: 0.81 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States

Cuprins

Preface; 1. Predicate Logic; 2. The Simple Imperative Language; 3. Programme Specifications and their Proofs; 4. Arrays; 5. Failure, Input-Output and Continuations; 6. Transition Semantics; 7. Nondeterminism and Guarded Commands; 8. Shared-variable Concurrency; 9. Communicating Sequential Processes; 10. The Lambda Calculus; 11. An Eager Functional Language; 12. Continuations in a Functional Language; 13. Iswim-like Languages; 14. A Normal-order Language; 15. The Simple Type System; 16. Subtypes and Intersection Types; 17. Polymorphism; 18. Module Specification; 19. Algol-like Languages; Appendices; Bibliography; Index.

Recenzii

"I found the whole book a distinct pleasure to read and certainly recommend this text for consideration by instructors." Mathematical Reviews
"clearly structured...the presentation is clear, and the typesetting often helps the reader to understand the structure of the formulas. Each chapter contains valuable exercises and profound bibliographic notes that can serve as a starting point for further reading. I shall use this excellent textbook in my lectures." Computing Reviews
"...an important book...It is thorough and well organized, and the explanations are very clear. I found the technical content to be in almost every respect flawless. Although written to be a student text, I believe that most researchers (and many practitioners) in programming lanauges (and related fields) would find it worth reading." Journal of Functional Programming

Descriere

This text is perfect for advanced undergraduate and beginning graduate courses in programming language theory.