南開科技大學圖書館 |

言語: 日文

ヘルプ

南開科技大學

圖書館首頁

編目中圖書申請

ログイン

ホームページ

スイッチ: ラベル | MARC形式 | 国際標準書誌記述(ISBD)

Types and programming languages

Pierce, Benjamin C.

Types and programming languages

レコード種別:	コンピュータ・メディア : 単行資料
タイトル / 著者:	Types and programming languages/ Benjamin C. Pierce.
著者:	Pierce, Benjamin C.
出版された:	Cambridge, Mass. :MIT Press,2002.
[NT 5503652] null:	CostPaid
記述:	1 online resource (xxi, 623 pages) :illustrations
主題:	Programming languages (Electronic computers) -
電子資源:	Click here for online access to this book (查閱全文) (EBSCO eBook)
国際標準図書番号 (ISBN):	058544269X (electronic bk.)
国際標準図書番号 (ISBN):	9780585442693 (electronic bk.)
国際標準図書番号 (ISBN):	0262256819 (electronic bk.)
国際標準図書番号 (ISBN):	9780262256810 (electronic bk.)

Types and programming languages
Pierce, Benjamin C.

Types and programming languages[electronic resource] /Benjamin C. Pierce. - Cambridge, Mass. :MIT Press,2002. - 1 online resource (xxi, 623 pages) :illustrations

Includes bibliographical references (pages 567-603) and index.

Introduction --1.

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.

ISBN: 058544269X (electronic bk.)

CostPaidFormOnlineAccessRestrictedSubjects--Topical Terms:

149354
Programming languages (Electronic computers)
Index Terms--Genre/Form:

172687
Electronic books.

LC Class. No.: QA76.7 / .P54 2002eb

Dewey Class. No.: 005.13

Types and programming languages
LDR:04851nmm 2200481Ia 4500 001 1000048738
005 20140814083130.0
006 m o d
007 cr cn|||||||||
008 030402s2002 maua ob 001 0 eng d
019 $a 51488215 $a 270933816 $a 473587334 $a 475499929 $a 568512831 $a 646742103 $a 666933293 $a 755663051 $a 827012669
020 $a 058544269X (electronic bk.)
020 $a 9780585442693 (electronic bk.)
020 $a 0262256819 (electronic bk.)
020 $a 9780262256810 (electronic bk.)
020 $z 0262162091
020 $z 9780262162098
035 $a (OCoLC)51958338 $z (OCoLC)51488215 $z (OCoLC)270933816 $z (OCoLC)473587334 $z (OCoLC)475499929 $z (OCoLC)568512831 $z (OCoLC)646742103 $z (OCoLC)666933293 $z (OCoLC)755663051 $z (OCoLC)827012669
035 $a ocm51958338
037 $c CostPaid $f FormOnline $g AccessRestricted $h GovNo
037 $a 0B715878-6649-4515-9445-6301A5880704 $b OverDrive, Inc. $n http://www.overdrive.com
040 $a N$T $b eng $e pn $c N$T $d YDXCP $d OCLCQ $d TUU $d OCLCQ $d TNF $d OCLCQ $d COO $d B24X7 $d UBY $d COCUF $d DKDLA $d CCO $d E7B $d CEF $d IDEBK $d CN5CF $d IEEEE $d ZCU $d OCLCF $d TEFOD $d OCLCQ
049 $a MAIN{me_controlnum}
050 4 $a QA76.7 $b .P54 2002eb
072 7 $a COM $x 051010 $2 bisacsh
082 0 4 $a 005.13 $2 21
084 $a 54.53 $2 bcl
100 1 $a Pierce, Benjamin C. $3 166804
245 1 0 $a Types and programming languages $h [electronic resource] / $c Benjamin C. Pierce.
260 $a Cambridge, Mass. : $b MIT Press, $c 2002.
300 $a 1 online resource (xxi, 623 pages) : $b illustrations
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
504 $a Includes bibliographical references (pages 567-603) and index.
505 0 0 $g 1. $t Introduction -- $g 2. $t Mathematical preliminaries -- $g [pt]. 1. $t Untyped systems -- $g 3. $t Untyped arithmetic expressions -- $g 4. $t An ML implementation of arithmetic expressions -- $g 5. $t The untyped Lambda-calculus -- $g 6. $t Nameless representation of terms -- $g 7. $t An ML implementation of the Lambda-calculus -- $g [pt]. 2. $t Simple types -- $g 8. $t Typed arithmetic expressions -- $g 9. $t Simply typed Lambda-calculus -- $g 10. $t An ML implementation of simple types -- $g 11. $t Simple extensions -- $g 12. $t Normalization -- $g 13. $t References -- $g 14. $t Exceptions -- $g [pt]. 3. $t Subtyping -- $g 15. $t Subtyping -- $g 16. $t Metatheory of subtyping -- $g 17. $t An ML implementation of subtyping -- $g 18. $t Case study : imperative objects -- $g 19. $t Case study : featherweight Java -- $g [pt]. 4. $t Recursive types -- $g 20. $t Recursive types -- $g 21. $t Metatheory of recursive types -- $g [pt.]. 5. $t Polymorphism -- $g 22. $t Type reconstruction -- $g 23. $t Universal types -- $g 24. $t Existential types -- $g 25. $t An ML implementation of system F -- $g 26. $t Bounded quantification -- $g 27. $t Case study : imperative objects, redux -- $g 28. $t Metatheory of bounded quantification -- $g [pt]. 6. $t Higher-order systems -- $g 29. $t Type operators and kinding -- $g 30. $t Higher-order polymorphism -- $g 31. $t Higher-order subtyping.
520 $a 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.
588 $a Description based on print version record.
650 0 $a Programming languages (Electronic computers) $3 149354
650 6 $a Langages de programmation. $3 174541
650 7 $a COMPUTERS $x Programming Languages $x General. $2 bisacsh $3 1000063661
650 1 7 $a Programmeertalen. $2 gtt $3 1000073184
650 7 $a Linguagem de programa簙跾o (textos avan簙ados) $2 larpcal $3 1000073185
655 4 $a Electronic books. $2 local. $3 172687
776 0 8 $i Print version: $a Pierce, Benjamin C. $t Types and programming languages. $d Cambridge, Mass. : MIT Press, 2002 $z 0262162091 $w (DLC) 2001044428 $w (OCoLC)47705787
856 4 0 $3 EBSCOhost $u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=70966 $z Click here for online access to this book (查閱全文) (EBSCO eBook)
938 $a Books 24x7 $b B247 $n bks00002148
938 $a ebrary $b EBRY $n ebr10225277
938 $a EBSCOhost $b EBSC $n 70966
938 $a Ingram Digital eBook Collection $b IDEB $n 209669
938 $a YBP Library Services $b YANK $n 2332559