Types and Programming Languages by Benjamin C. Pierce (PDF)

12

 

Ebook Info

  • Published: 2002
  • Number of pages:
  • Format: PDF
  • File Size: 2.19 MB
  • Authors: Benjamin C. Pierce

Description

A comprehensive introduction to type systems and programming languages.A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems—and of programming languages from a type-theoretic perspective—has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐I need basic information on type safety, theory of object oriented typing, and how to axiomatize nonstandard kind of typing systems. I need it now, in a form that I can put to use without too many side tripsThis book is almost what I was looking for. It builds up a semantic logic based on lambda calculus, then creates typed versions. Pierce really does work very methodically up through the levels, ending at about the place where C++ templates and recursive type definitions start. Along the way, he’s careful to match the typing axioms to semantics, covering unusual topics like exceptions and type inference while he’s at it.Almost what I was looking for, but not quite. As I said, I have immediate needs, and I’m not into theory for its own sweet sake. That means I had little appreciation for all the chapters that created arithmetic all over again, starting from Peano axioms (or something like), via the lambda calculus. I know that low-level axiomatizations and lambda calculus are much beloved of the theoreticians, but I encounter them only rarely, and when I was trying to get something else done, like now. For me, they created a diversion blocked by an impediment. Also, however convenient it may be for theory, functional programming is mostly a journal-page peculiarity in industrial practice. I admit, analysis of functional programs pushed me into insight I might have missed, but I would probably have been quite happy dealing with assignment formalisms instead.I almost gave this three stars, because its unnecessary notational baggage and off-main-stream topics weren’t doing my job. Bruce’s book (ISBN 026202523X) was a much more profitable use of my time. Still, Pierce’s goals weren’t mine, and the mansion of type analysis has many rooms. Not all of those rooms are furnished to my taste, and don’t need to be. I rounded up to four stars for what it meant to do.//wiredweird

⭐Had to buy the book for a college class. Definitely one of the better written textbooks.

⭐This is a great book. Benjamin’s style is fairly conversational keeping this very dry and logical topic fresh and inviting. The notation used can seem a little esoteric for the uninitiated, however there is enough detail early on to get you over this hurdle quickly. Soon you will be writing your own substitutions, elimination rules and type judgements needed for any programming language you might want to design.

⭐Fantastic, very well-written book on exciting topic. It’s too big to carry for in-transport reading, so I’ll use it at home, and continue reading from phone in parallel.

⭐In my opinion the best written and most effective introduction to type theory and programming languages. I am having fun implementing a practical functional programming language with dependent types and this book is always next to me when I code.

⭐An extraordinarily clear and well written treatment of Programming Language Theory.

⭐This is a great book, but the kindle version is absolutely awful.

⭐This book explains what you would expect from title in a clear, understandable way for those who are not familiar with programming language theory. It doesn’t make assumptions on previous knowledge of the reader.

⭐If you are into programming languages, I am recommending the book. Explains stuff well and is relatively easy to read (for a textbook).

⭐This is the standard text on practical type theory for programming languages. It deserves its place. Reading it is not easy, but then again this is a text for graduate students.

⭐Fast delivery. Great book, thanks.

⭐Very good introduction to the topic, with a lot of exercises and solutions.

⭐Als Anfänger in Type-Systeme hatte ich das Buch begleitend zu einer Vorlesung gelesen und ich muss sagen, es ist die perfekte Ergänzung und ist super verständlich geschrieben.

Keywords

Free Download Types and Programming Languages in PDF format
Types and Programming Languages PDF Free Download
Download Types and Programming Languages 2002 PDF Free
Types and Programming Languages 2002 PDF Free Download
Download Types and Programming Languages PDF
Free Download Ebook Types and Programming Languages

Previous articleGeneric Programming: Advanced Lectures by Roland Backhouse (PDF)
Next articleA List of Successes That Can Change the World: Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday (Lecture Notes in Computer Science, 9600) by Sam Lindley (PDF)