Lambda Calculus with Types

Type Book

Rate 0.0 /5

This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.

Details

Files

Reviews

Download

Title Statements

Full title :Lambda Calculus with Types / Henk Barendregt, Wil Dekkers, Richard Statman ; with contributions fron Fabio Alessi [and others].

Summary

This handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.

Edition Statements

Publication Date:2013.

Publication Statements

Publisher(s):Cambridge University Press
Place of Publication:Cambridge
Language:eng
Publication Date:2013.

Notes

16.3 mathcal D infty models as filter models.

The Physical Object

Description:1 online resource (857 pages)

Edition Identifiers

ISBN:9781461936565, 146193656X, 9781107272248, 1107272246, 9781139032636, 1139032631, 9780521766142, 0521766141, 9781107471313, 1107471311
oclc:ocn854975198
LC Classification:QA9.5
Dewey Decimal:511.3

Lambda Calculus with Types; Contents; Preface; Contributors; Our Founders; Introduction; Part I: Simple Types lambda rightarrow mathbb A; 1 The Simply Typed Lambda Calculus; 1.1 The systems lambda rightarrow mathbb A; 1.2 First properties and comparisons; 1.3 Normal inhabitants; 1.4 Representing data types; 1.5 Exercises; 2 Properties; 2.1 Normalization; 2.2 Proofs of strong normalization; 2.3 Checking and finding types; 2.4 Checking inhabitation; 2.5 Exercises; 3 Tools; 3.1 Semantics of lambda rightarrow; 3.2 Lambda theories and term models; 3.3 Syntactic and semantic logical relations.

3.4 Type reducibility3.5 The five canonical term-models; 3.6 Exercises; 4 Definability, unification and matching; 4.1 Undecidability of lambda-definability; 4.2 Undecidability of unification; 4.3 Decidability of matching of rank 3; 4.4 Decidability of the maximal theory; 4.5 Exercises; 5 Extensions; 5.1 Lambda delta; 5.2 Surjective pairing; 5.3 Gödel's system mathcal T: higher-order primitive recursion; 5.4 Spector's system mathcal B: bar recursion; 5.5 Platek's system mathcal Y: fixed point recursion; 5.6 Exercises; 6 Applications; 6.1 Functional programming; 6.2 Logic and proof-checking.

6.3 P…