Vous voulez être sûr que vos cadeaux seront sous le sapin de Noël à temps? Nos magasins vous accueillent à bras ouverts. La plupart de nos magasins sont ouverts également les dimanches, vous pouvez vérifier les heures d'ouvertures sur notre site.

Retrait gratuit dans votre magasin Club
7.000.000 titres dans notre catalogue
Payer en toute sécurité
Toujours un magasin près de chez vous

Retrait gratuit dans votre magasin Club
7.000.0000 titres dans notre catalogue
Payer en toute sécurité
Toujours un magasin près de chez vous

Magasins

Wishlist

Magasins

Wishlist

Chercher

Livres

Ebooks

Papeterie

Jeux

Cadeaux

Tous les produits

Dédicaces

Jobs

Articles

72,95 €

+ 145 points

Format

Livraison 1 à 2 semaines

Passer une commande en un clic

Payer en toute sécurité

Livraison en Belgique: 3,99 €

Livraison en magasin gratuite

Description

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.