Nominal Sets (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
287
Utgivningsdatum
2013-05-30
Förlag
Cambridge University Press
Illustrationer
20 b/w illus. 80 exercises
Volymtitel
Series Number 57 Nominal Sets: Names and Symmetry in Computer Science
Dimensioner
229 x 147 x 15 mm
Vikt
545 g
Antal komponenter
1
Komponenter
14:B&W 6 x 9 in or 229 x 152 mm Case Laminate on White w/Gloss Lam
ISBN
9781107017788

Nominal Sets

Names and Symmetry in Computer Science

Inbunden,  Engelska, 2013-05-30
781
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 2 format & utgåvor
Nominal sets provide a promising new mathematical analysis of names in formal languages based upon symmetry, with many applications to the syntax and semantics of programming language constructs that involve binding, or localising names. Part I provides an introduction to the basic theory of nominal sets. In Part II, the author surveys some of the applications that have developed in programming language semantics (both operational and denotational), functional programming and logic programming. As the first book to give a detailed account of the theory of nominal sets, it will be welcomed by researchers and graduate students in theoretical computer science.
Visa hela texten

Passar bra ihop

  1. Nominal Sets
  2. +
  3. Co-Intelligence

De som köpt den här boken har ofta också köpt Co-Intelligence av Ethan Mollick (häftad).

Köp båda 2 för 971 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Andrew M Pitts

  • Semantics and Logics of Computation

    Andrew M Pitts

    The aim of this volume is to present developments in semantics and logics of computation in a way that is accessible to graduate students. The book is based on a summer school at the Isaac Newton Institute and consists of a sequence of linked lect...

Övrig information

Andrew Pitts FACM FBCS is Professor of Theoretical Computer Science at the University of Cambridge and a Fellow of Darwin College.

Innehållsförteckning

Preface; Introduction; Part I. Theory: 1. Permutation; 2. Support; 3. Freshness; 4. Name abstraction; 5. Orbit finiteness; 6. Equivalents of Nom; Part II. Applications: 7. Inductive and conductive definitions; 8. Nominal algebraic data types; 9. Locally scoped names; 10. Functional programming; 11. Domain theory; 12. Computational logic; References; Notation index; Index.