skip to content
Types and programming languages Preview this item
ClosePreview this item
Checking...

Types and programming languages

Author: Benjamin C Pierce
Publisher: Cambridge, Mass. : MIT Press, 2002.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Benjamin C Pierce
ISBN: 0262162091 9780262162098
OCLC Number: 47705787
Description: xxi, 623 p. : ill. ; 24 cm.
Contents: 1. Introduction --
2. Mathematical preliminaries --
[pt]. 1. Untyped systems --
3. Untyped arithmetic expressions --
4. An ML implementation of arithmetic expressions --
5. The untyped Lambda-calculus --
6. Nameless representation of terms --
7. An ML implementation of the Lambda-calculus --
[pt]. 2. Simple types --
8. Typed arithmetic expressions --
9. Simply typed Lambda-calculus --
10. An ML implementation of simple types --
11. Simple extensions --
12. Normalization --
13. References --
14. Exceptions --
[pt]. 3. Subtyping --
15. Subtyping --
16. Metatheory of subtyping --
17. An ML implementation of subtyping --
18. Case study : imperative objects --
19. Case study : featherweight Java --
[pt]. 4. Recursive types --
20. Recursive types --
21. Metatheory of recursive types --
[pt.]. 5. Polymorphism --
22. Type reconstruction --
23. Universal types --
24. Existential types --
25. An ML implementation of system F --
26. Bounded quantification --
27. Case study : imperative objects, redux --
28. Metatheory of bounded quantification --
[pt]. 6. Higher-order systems --
29. Type operators and kinding --
30. Higher-order polymorphism --
31. Higher-order subtyping.
Responsibility: Benjamin C. Pierce.

Abstract:

A comprehensive introduction to type systems and programming languages.  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"Types are the leaven of computer programming; they make it digestible. This excellent book uses types to navigate the rich variety of programming languages, bringing a new kind of unity to their Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/47705787>
library:oclcnum"47705787"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/47705787>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1078704>
rdf:typeschema:Intangible
schema:name"Programming languages (Electronic computers)"@en
schema:about
schema:creator
schema:datePublished"2002"
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/8440767>
schema:inLanguage"en"
schema:name"Types and programming languages"@en
schema:numberOfPages"623"
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.