[Prev][Next][Index][Thread]
New book: Types and Programming Languages
-
To: logic@cs.stanford.edu, lics@math.uic.edu, theorynt@listserv.uic.edu, ccl@ps.uni-sb.de, concurrency@cwi.nl, CLANGSRV-request@LISTS.ASU.EDU, CPP-L-request@LISTS.UFL.EDU, eacsl@dimi.uniud.it, eapls-request@jiscmail.ac.uk, eatcs-it@cs.unibo.it, types@cis.upenn.edu, ecoop-info@ecoop.org, categories@mta.ca, lcs@cis.upenn.edu, sdrl@cis.upenn.edu, cis-faculty@cis.upenn.edu, plclub@cis.upenn.edu, caml-list@pauillac.inria.fr
-
Subject: New book: Types and Programming Languages
-
From: "Benjamin C. Pierce" <bcpierce@saul.cis.upenn.edu>
-
Date: Sat, 23 Feb 2002 13:06:00 EST
-
Reply-to: bcpierce@cis.upenn.edu
I'm pleased to announce the publication of a new graduate-level textbook
on type systems and foundations of programming languages:
Types and Programming Languages
by Benjamin C. Pierce
8x9", 624 pp., 60 illus., cloth
ISBN 0-262-16209-1
For more information (and a direct link for ordering from Amazon), please
visit...
http://www.cis.upenn.edu/~bcpierce/tapl
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.
Enjoy,
-- Benjamin
-----------------------------------------------------------------------------
BENJAMIN C. PIERCE, Professor
Dept. of Computer & Information Science bcpierce@cis.upenn.edu
University of Pennsylvania +1 215 898-2012
200 South 33rd St. Fax: +1 215 898-0587
Philadelphia, PA 19104, USA http://www.cis.upenn.edu/~bcpierce
-----------------------------------------------------------------------------