Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Programming Languages: Build, Prove, and Compare
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Programming Languages: Build, Prove, and Compare

Programming Languages: Build, Prove, and Compare

Norman Ramsey

600 pages, parution le 26/10/2022

Résumé

This 'great ideas applied in practice' textbook emphasizes practice. It distills key programming languages and their design ideas down to small, simple languages implemented by an interpreter, The hands-on approach lets readers develop skills that will help them be productive programmers even in languages they've never seen before.Computer scientists often need to learn new programming languages quickly. The best way to prepare for this is to understand the foundational principles that underlie even the most complicated industrial languages. This text for an undergraduate programming languages course distills great languages and their design principles down to easy-to-learn 'bridge' languages implemented by interpreters whose key parts are explained in the text. The book goes deep into the roots of both functional and object-oriented programming, and it shows how types and modules, including generics/polymorphism, contribute to effective programming. The book is not just about programming languages; it is also about programming. Through concepts, examples, and more than 300 practice exercises that exploit the interpreter, students learn not only what programming-language features are but also how to do things with them. Substantial implementation projects include Milner's type inference, both copying and mark-and-sweep garbage collection, and arithmetic on arbitrary-precision integers.Preface; Acknowledgments; Credits; Tables of judgment forms, important functions, and concrete syntax; List of symbols and notation; Introduction; Part I. Foundations: 1. An imperative core; 2. Scheme, S-expressions, and first class functions; 3. Control operators and a small-step semantics: Scheme+; 4. Automatic memory management; 5. Interlude: Scheme in ML; 6. Type systems for Impcore and Scheme; 7. ML and type inference; Part II. Programming at Scale: 8. User-defined, algebraic types; 9. Molecule, abstract data types, and modules; 10. Smalltalk and object orientation; Afterword; Bibliography; Key words and phrases; Concept index.Norman Ramsey is Associate Professor of Computer Science at Tufts University. Since earning his Ph.D. at Princeton, he has worked in industry and has taught programming languages, advanced functional programming, programming-language implementation, and technical writing at Purdue, the University of Virginia, and Harvard as well as Tufts. He has received Tufts's Lerman-Neubauer Prize, awarded annually to one outstanding undergraduate teacher. He has also been a Hertz Fellow and an Alfred P. Sloan Research Fellow. His implementation credits include a code generator for the Standard ML of New Jersey compiler and another for the Glasgow Haskell Compiler.

Caractéristiques techniques

  PAPIER
Éditeur(s) Cambridge University Press
Auteur(s) Norman Ramsey
Parution 26/10/2022
Nb. de pages 600
EAN13 9781107180185

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription