Amazon cover image
Image from Amazon.com

Handbook of theoretical computer science / edited by Jan van Leeuwen.

By: Contributor(s): Material type: TextPublication details: Amsterdam ; New York : ; Cambridge, Elsevier Mass MIT Press, 1990.Edition: First MIT Press paperback editionDescription: 2 volumes : illustrations ; 25 cmISBN:
  • 9780262720205
  • 0444880712
  • 0333880749
  • 0262220407
  • 0262720205
  • 0262220385
  • 0262720140
  • 0262220393
  • 0262720159
ISSN:
  • 9780262720151
Subject(s): LOC classification:
  • QA76 .H279
Contents:
CHAPTER 1. Finite Automata CHAPTER 2. Context - Free Languages CHAPTER 3. Formal Languages and Power Series CHAPTER 4. Automata on infinite objects CHAPTER 5. Graph rewriting: An algebraic and logic approach CHAPTER 6. Rewrite systems CHAPTER 7. Functional programming and lambda calculus CHAPTER 8. Type systems for programming languages CHAPTER 9. Recursive Applicative program schemes CHAPTER 10. Logic programming CHAPTER 11. Denominational semantics CHAPTER 12. Semantic domains CHAPTER 13. Algebraic specification CHAPTER 14. Logics of programs CHAPTER 15. Methods and logics for proving programs CHAPTER 16. Temporal and modal logic CHAPTER 17. elements of relational data theory CHAPTER 18. Distributed computing: Models and methods CHAPTER 19. Operational and algebraic semantics of concurrent processes
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Books Methodist University Library Main General Stacks Reference QA76 .H279 (Browse shelf(Opens below)) Available 35344

Includes bibliographical references and indexes

CHAPTER 1. Finite Automata
CHAPTER 2. Context - Free Languages
CHAPTER 3. Formal Languages and Power Series
CHAPTER 4. Automata on infinite objects
CHAPTER 5. Graph rewriting: An algebraic and logic approach
CHAPTER 6. Rewrite systems
CHAPTER 7. Functional programming and lambda calculus
CHAPTER 8. Type systems for programming languages
CHAPTER 9. Recursive Applicative program schemes
CHAPTER 10. Logic programming
CHAPTER 11. Denominational semantics
CHAPTER 12. Semantic domains
CHAPTER 13. Algebraic specification
CHAPTER 14. Logics of programs
CHAPTER 15. Methods and logics for proving programs
CHAPTER 16. Temporal and modal logic
CHAPTER 17. elements of relational data theory
CHAPTER 18. Distributed computing: Models and methods
CHAPTER 19. Operational and algebraic semantics of concurrent processes

There are no comments on this title.

to post a comment.
Share
Copyright © 2026  MUG Library