36%
Programming Language Foundations

Programming Language Foundations

          
5
4
3
2
1

International Edition


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

Programming Language Foundations is a concise text that covers a wide range of topics in the mathematical semantics of programming languages, for readers without prior advanced background in programming languages theory. The goal of the book is to provide rigorous but accessible coverage of essential topics in the theory of programming languages. Stump’s Programming Language Foundations is intended primarily for a graduate-level course in programming languages theory which is standard in graduate-level CS curricula. It may also be used in undergraduate programming theory courses but ONLY where students have a strong mathematical preparation.

Table of Contents:
Preface 1 I Central Topics 7 1 Semantics of First-Order Arithmetic 9 1.1 Syntax of FO(Z) terms 10 1.2 Informal semantics of FO(Z) terms 10 1.3 Syntax of FO(Z) formulas 11 1.4 Some alternative logical languages for arithmetic 12 1.5 Informal semantics of FO(Z) formulas 13 1.6 Formal semantics of FO(Z) terms 14 1.6.1 Examples 17 1.7 Formal semantics of FO(Z) formulas 18 1.7.1 Examples 18 1.8 Compositionality 19 1.9 Validity and satisfiability 19 1.10 Interlude: proof by natural-number induction 20 1.11 Proof by structural induction 27 1.12 Conclusion 28 1.13 Basic exercises 29 1.14 Intermediate exercises 30 2 Denotational Semantics of WHILE 33 2.1 Syntax and informal semantics of WHILE 33 2.2 Beginning of the formal semantics for WHILE 34 2.3 Problem with the semantics of while-commands 35 2.4 Domains 37 2.5 Continuous functions 42 2.6 The least fixed-point theorem 46 2.7 Completing the formal semantics of commands 48 2.8 Connection to practice: static analysis using abstract interpretation 54 2.9 Conclusion 59 2.10 Basic exercises 60 2.11 Intermediate exercises 62 3 Axiomatic Semantics of WHILE 65 3.1 Denotational equivalence 66 3.2 Partial correctness assertions 68 3.3 Interlude: rules and derivations 71 3.4 Hoare Logic rules 76 3.5 Example derivations in Hoare Logic 82 3.6 Soundness of Hoare Logic and induction on the structure of derivations 87 3.7 Conclusion 92 3.8 Exercises 92 4 Operational Semantics of WHILE  95 4.1 Big-step semantics of WHILE  95 4.2 Small-step semantics of WHILE  97 4.3 Relating the two operational semantics 101 4.4 Conclusion 120 4.5 Basic exercises 120 4.6 Intermediate exercises 122 5 Untyped Lambda Calculus 125 5.1 Abstract syntax of untyped lambda calculus 125 5.2 Operational semantics: full b-reduction 127 5.3 Defining full b-reduction with contexts 132 5.4 Specifying other reduction orders with contexts 134 5.5 Big-step call-by-value operational semantics 137 5.6 Relating big-step and small-step operational semantics 138 5.7 Conclusion 142 5.8 Basic Exercises 143 5.9 Intermediate Exercises 147 5.10 More Challenging Exercises 147 6 Programming in Untyped Lambda Calculus 149 6.1 The Church encoding for datatypes 149 6.2 The Scott encoding for datatypes 156 6.3 Other datatypes: lists 158 6.4 Non-recursive operations on Scott-encoded data 158 6.5 Recursive equations and the fix operator 160 6.6 Another recursive example: multiplication 162 6.7 Conclusion  162 6.8 Basic exercises 163 6.9 Intermediate exercises 164 7 Simple Type Theory 167 7.1 Abstract syntax of simple type theory 167 7.2 Semantics of types 168 7.3 Type-assignment rules 169 7.4 Semantic soundness for type-assignment rules 169 7.5 Applying semantic soundness to prove normalization 171 7.6 Type preservation 173 7.7 The Curry-Howard isomorphism 176 7.8 Algorithmic typing 183 7.9 Algorithmic typing via constraint generation 186 7.10 Subtyping 190 7.11 Conclusion 199 7.12 Basic Exercises 200 7.13 Intermediate Exercises  202 II Extra Topics 205 8 Nondeterminism and Concurrency 207 8.1 Guarded commands 207 8.2 Operational semantics of guarded commands 208 8.3 Concurrent WHILE 215 8.4 Operational semantics of concurrent WHILE  216 8.5 Milner’s Calculus of Communicating Systems 219 8.6 Operational semantics of CCS 220 8.7 Conclusion 226 8.8 Basic exercises 226 8.9 Intermediate exercises 228 9 More on Untyped Lambda Calculus 231 9.1 Confluence of untyped lambda calculus 231 9.2 Combinators 259 9.3 Conclusion 266 9.4 Basic exercises 266 9.5 Intermediate exercises 267 10 Polymorphic Type Theory 269 10.1 Type-assignment version of System F 269 10.2 Annotated terms for System F 271 10.3 Semantics of annotated System F 272 10.4 Programming with Church-encoded data 274 10.5 Higher-kind polymorphism and System Fw  276 10.6 Conclusion 283 10.7 Exercises 283 11 Functional Programming 285 11.1 Call-by-value functional programming 286 11.2 Connection to practice: eager FP in OCaml 11.3 Lazy programming with call-by-name evaluation 300 11.4 Connection to practice: lazy FP in Haskell 304 11.5 Conclusion 310 11.6 Basic Exercises 310 11.7 Intermediate exercises 312 Mathematical Background 315 Bibliography 321 Index 325 


Best Sellers


Product Details
  • ISBN-13: 9781118007471
  • Publisher: John Wiley & Sons Inc
  • Publisher Imprint: John Wiley & Sons Inc
  • Depth: 13
  • Language: English
  • Returnable: N
  • Spine Width: 13 mm
  • Width: 185 mm
  • ISBN-10: 1118007476
  • Publisher Date: 26 Nov 2013
  • Binding: Paperback
  • Height: 231 mm
  • No of Pages: 336
  • Series Title: English
  • Weight: 476 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Programming Language Foundations
John Wiley & Sons Inc -
Programming Language Foundations
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Programming Language Foundations

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA