Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Full Abstraction and Semantic Equivalence…

Full Abstraction and Semantic Equivalence (ACM Doctoral Dissertation…

by Ketan Mulmuley

MembersReviewsPopularityAverage ratingConversations
Recently added byJohn_Scott

No tags.



Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
Important places
Important events
Related movies
Awards and honors
First words
Last words
Disambiguation notice
Publisher's editors
Publisher series
Original language

References to this work on external resources.

Wikipedia in English (1)

Book description
Haiku summary

Amazon.com Product Description (ISBN 0262132273, Hardcover)

Full Abstraction and Semantic Equivalence demonstrates an original theory that uses the same inclusive predicates to show semantic equivalence and to construct fully abstract, extensional submodels.

Previous general techniques for proving semantic equivalence, through the construction of inclusive predicates, have foundered due to their complexity and the lack of any counter-examples. In this book, Mulmuley has been able to construct a counterexample through diagonalization; moreover, he has discovered a technique to prove semantic equivalences that has the advantage of being mechanizable. This system, called Inclusive Predicate Logic (IPL), can almost automatically prove the existence of most of the inclusive predicates which arise in practice.

Mulmuley also demonstrates that one can construct a fully abstract algebraic model of typed lambda calculus which is a submodel of the classical model, if the classical model is based on complete lattices. Beyond this, the book shows that theory can extend to the case of a language that has reflexive (recursively defined) types-as do most of the "real" programming languages.

Contents: Introduction to Domain Theory. The Problem of Inclusive Predicate Existence. Fully Abstract Submodels of Typed Lambda Calculi. Fully Abstract Submodels in the Presence of Reflexive Types. A Mechanizable Theory for Existence Proofs. IPL Implementation. Conclusion.

Ketan Mulmuley is a Miller Fellow in the Department of Electrical Engineering and Computer Science at the University of California, Berkeley. Full Abstraction and Semantic Equivalence is a winner of the 1986 ACM Doctoral Dissertation Award.

(retrieved from Amazon Thu, 12 Mar 2015 18:13:44 -0400)

No library descriptions found.

Quick Links

Swap Ebooks Audio

Popular covers



Average: No ratings.

Is this you?

Become a LibraryThing Author.


About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 119,689,279 books! | Top bar: Always visible