Basic Simple Type Theory

AvJ. Roger Hindley

Häftad, Engelska, 2008

Del 42 i serien Cambridge Tracts in Theoretical Computer Science

653 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 444 kr

Beskrivning

Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.

Produktinformation

Utgivningsdatum:2008-01-21
Mått:151 x 228 x 11 mm
Vikt:310 g
Format:Häftad
Språk:Engelska
Serie:Cambridge Tracts in Theoretical Computer Science
Antal sidor:200
Förlag:Cambridge University Press
ISBN:9780521054225

Utforska kategorier

Recensioner i media

"This is an excellent introduction to type theory. It doesn't bog the reader down in any of the messy details of the proofs and yet it provides many of the most interesting results in the field....Overall, it is a great book for someone who wants to get his feet wet in type theory, but doesn't want to get in over his head." Sigact News

Innehållsförteckning

Introduction; 1. The type-free λ-calculus; 2. Assigning types to terms; 3. The principal-type algorithm; 4. Type assignment with equality; 5. A version using typed terms; 6. The correspondence with implication; 7. The converse principal-type algorithm; 8. Counting a type's inhabitants; 9. Technical details; Answers to starred exercises; Bibliography; Table of principal types; Index.

Mer från samma författare

Lambda-Calculus and Combinators

J. Roger Hindley, Jonathan P. Seldin

Inbunden, 2008

1 147 kr

Typed Lambda Calculi and Applications

Philippe de Groote, J. Roger Hindley

Häftad, 1997

555 kr

Mer från samma serie

Del 27

Programs, Recursion and Unbounded Choice

Wim H. Hesselink, C. J. van Rijsbergen

Häftad, 2005

787 kr

Del 23

Nets, Terms and Formulas

E. -R. Olderog, C. J. Van Rijsbergen, C. J. van Rijsbergen, Samson Abramsky

Häftad, 2005

787 kr

Del 34

Two-Level Functional Languages

Flemming Nielson, Hanne Riis Nielson, C. J. van Rijsbergen

Häftad, 2005

885 kr

Del 19

Extensions of First-Order Logic

Maria Manzano, C. J. Van Rijsbergen, C. J. van Rijsbergen, Samson Abramsky

Häftad, 2005

1 163 kr

Del 40

Free Choice Petri Nets

Jorg Desel, Javier Esparza, C. J. van Rijsbergen

Häftad, 2005

700 kr

Del 32

The Logic of Typed Feature Structures

Robert L. Carpenter, C. J. Van Rijsbergen, C. J. van Rijsbergen, Samson Abramsky

Häftad, 2005

787 kr

Del 28

Deductive and Declarative Programming

Peter Padawitz, C. J. van Rijsbergen

Häftad, 2006

787 kr

Del 39

The Uncertain Reasoner's Companion

J. B. Paris, C. J. Van Rijsbergen, C. J. van Rijsbergen, Samson Abramsky

Häftad, 2006

820 kr

Del 3

Understanding Z

J. M. Spivey

Häftad, 2008

639 kr

Del 46

Domains and Lambda-Calculi

Roberto M. Amadio, Pierre-Louis Curien

Häftad, 2008

955 kr

Du kanske också är intresserad av

10% rabatt på allt

L'amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Del 42