DeepRead
Cover of Basic simple type theory

Basic simple type theory

J. Roger Hindley · 1997

Programming and computer science › Lisp and Scheme

#15,155 most recommended

About the book

A textbook on the simply typed lambda calculus, the basic type system for functional programming and higher-order logic. It covers typed terms in both Curry-style (types assigned to untyped terms) and Church-style (types built into terms) presentations, with their reduction and equality theories. It is aimed at students and researchers in logic, programming languages and theoretical computer science. The book presents simple type theory as a rigorous foundation for typed functional languages and proves its core metatheory in detail. Its central results include the existence of principal types for typable terms, which make type inference decidable, and the strong normalization and Church-Rosser properties of typed reduction. It also connects these results to combinatory logic and to the typing of programming-language constructs.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

024201320142016201820192013 peak · 1
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1997
ISBN
9780521054225
Editions known
8 at Open Library
Open Library
OL3750249W

Langages de programmationProgrammeertalenProgramming LanguagesProgramming languages (Electronic computers)Programming languages (electronic computers)Théorie des typesType theoryTypentheorieTypes, Théorie des

Explore in the mosaic

Read next: its neighbours on the mosaic