› › Basic Simple Type Theory

Basic Simple Type Theory

Author : J. Roger Hindley

Publisher : Cambridge University Press

Page : 200 pages

File Size : 11,8 MB

Release : 1997

Category : Computers

ISBN : 0521465184

Get eBook

Book Description

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. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. 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 that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.



Basic Simple Type Theory

Author : J. Roger Hindley

Publisher : Cambridge University Press

Page : 0 pages

File Size : 48,47 MB

Release : 2008-01-21

Category : Computers

ISBN : 9780521054225

Get eBook

Book Description

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. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. 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 that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.



Type Theory and Formal Proof

Author : Rob Nederpelt

Publisher : Cambridge University Press

Page : 465 pages

File Size : 27,14 MB

Release : 2014-11-06

Category : Computers

ISBN : 1316061086

Get eBook

Book Description

Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems, including the well-known and powerful Calculus of Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalise mathematics. The only prerequisite is a basic knowledge of undergraduate mathematics. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarise themselves with the material.



Categorical Logic and Type Theory

Author : B. Jacobs

Publisher : Gulf Professional Publishing

Page : 784 pages

File Size : 28,97 MB

Release : 2001-05-10

Category : Computers

ISBN : 9780444508539

Get eBook

Book Description

This book is an attempt to give a systematic presentation of both logic and type theory from a categorical perspective, using the unifying concept of fibred category. Its intended audience consists of logicians, type theorists, category theorists and (theoretical) computer scientists.



Categories for Types

Author : Roy L. Crole

Publisher : Cambridge University Press

Page : 362 pages

File Size : 48,64 MB

Release : 1993

Category : Computers

ISBN : 9780521457019

Get eBook

Book Description

This textbook explains the basic principles of categorical type theory and the techniques used to derive categorical semantics for specific type theories. It introduces the reader to ordered set theory, lattices and domains, and this material provides plenty of examples for an introduction to category theory, which covers categories, functors, natural transformations, the Yoneda lemma, cartesian closed categories, limits, adjunctions and indexed categories. Four kinds of formal system are considered in detail, namely algebraic, functional, polymorphic functional, and higher order polymorphic functional type theory. For each of these the categorical semantics are derived and results about the type systems are proved categorically. Issues of soundness and completeness are also considered. Aimed at advanced undergraduates and beginning graduates, this book will be of interest to theoretical computer scientists, logicians and mathematicians specializing in category theory.



Twenty Five Years of Constructive Type Theory

Author : Giovanni Sambin

Publisher : Clarendon Press

Page : 292 pages

File Size : 12,48 MB

Release : 1998-10-15

Category : Mathematics

ISBN : 0191606936

Get eBook

Book Description

Per Martin-Löf's work on the development of constructive type theory has been of huge significance in the fields of logic and the foundations of mathematics. It is also of broader philosophical significance, and has important applications in areas such as computing science and linguistics. This volume draws together contributions from researchers whose work builds on the theory developed by Martin-Löf over the last twenty-five years. As well as celebrating the anniversary of the birth of the subject it covers many of the diverse fields which are now influenced by type theory. It is an invaluable record of areas of current activity, but also contains contributions from N. G. de Bruijn and William Tait, both important figures in the early development of the subject. Also published for the first time is one of Per Martin-Löf's earliest papers.



Basic Category Theory

Author : Tom Leinster

Publisher : Cambridge University Press

Page : 193 pages

File Size : 47,54 MB

Release : 2014-07-24

Category : Mathematics

ISBN : 1107044243

Get eBook

Book Description

A short introduction ideal for students learning category theory for the first time.



Basic Proof Theory

Author : A. S. Troelstra

Publisher : Cambridge University Press

Page : 436 pages

File Size : 42,74 MB

Release : 2000-07-27

Category : Computers

ISBN : 9780521779111

Get eBook

Book Description

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.



Programming in Martin-Löf's Type Theory

Author : Bengt Nordström

Publisher : Oxford University Press, USA

Page : 240 pages

File Size : 35,87 MB

Release : 1990

Category : Computers

ISBN :

Get eBook

Book Description

In recent years, several formalisms for program construction have appeared. One such formalism is the type theory developed by Per Martin-Löf. Well suited as a theory for program construction, it makes possible the expression of both specifications and programs within the same formalism. Furthermore, the proof rules can be used to derive a correct program from a specification as well as to verify that a given program has a certain property. This book contains a thorough introduction to type theory, with information on polymorphic sets, subsets, monomorphic sets, and a full set of helpful examples.



Types and Programming Languages

Author : Benjamin C. Pierce

Publisher : MIT Press

Page : 656 pages

File Size : 21,87 MB

Release : 2002-01-04

Category : Computers

ISBN : 9780262162098

Get eBook

Book Description

A comprehensive introduction to type systems 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 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.