Types 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 applicat...

Full description

Saved in:
Bibliographic Details
Main Author: Pierce, Benjamin C.
Format: eBook
Language: English
Published: Cambridge, Mass. : MIT Press, 2002.
Subjects:
Programming languages (Electronic computers)
elektronické knihy
electronic books
ISBN: 9780262256810
Physical Description: 1 online zdroj (xxi, 623 pages) : illustrations

Cover

Table of contents

LEADER 04329cam a2200361 a 4500
001 74744
003 CZ ZlUTB
005 20240911212132.0
006 m d
007 cr un
008 030402s2002 maua sb 001 0 eng d
020 |a 9780262256810  |q (ebook) 
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 
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 
100 1 |a Pierce, Benjamin C. 
245 1 0 |a Types and programming languages  |h [elektronický zdroj] /  |c Benjamin C. Pierce. 
260 |a Cambridge, Mass. :  |b MIT Press,  |c 2002. 
300 |a 1 online zdroj (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. 
506 |a Plný text je dostupný pouze z IP adres počítačů Univerzity Tomáše Bati ve Zlíně nebo vzdáleným přístupem pro zaměstnance a studenty univerzity 
650 0 |a Programming languages (Electronic computers) 
655 7 |a elektronické knihy  |7 fd186907  |2 czenas 
655 9 |a electronic books  |2 eczenas 
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 |u https://proxy.k.utb.cz/login?url=http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267321  |y Plný text 
992 |a BK  |c EBOOK-TN  |c MITPRESS 
999 |c 74744  |d 74744 
993 |x NEPOSILAT  |y EIZ 

Similar Items