Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Engleski
197 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Tvrdi uvez
31.68
€
/
Meki uvez
6.37
€
/
Meki uvez
20.75
€
/
Meki uvez
49.00
€
/
Meki uvez
20.85
€
/
Meki uvez
28.95
€
The *L-calculus lies at the very foundations of Computer Science. Besides its historical role in compatibility theory it has had significant influence on programming language design and implementation, denotational semantics and domain theory. The book emphasises the proof theory for the type-free *L-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability and the relationship between the *L -calculus and Combinatoryh Logic. Chapter 7 presents a variety of typed calculi; first the simply typed *L-calculus, then Milner-style polymorphism and, finally the polymorphic *L-calculus. Chapter 8 concerns three variants of the type-free *L-calculus that have recently appeared in the research literature: the lazy *L calculus, the concurrent *Y-calculus and the *L*O-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, the book is written from a Computer Science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in Computer Science. Research Students should find it a useful introduction to more specialist literature.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
8.60
€
/
Meki uvez
13.05
€
/
Tvrdi uvez
29.76
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?