{
"item_title" : "Models of Sharing Graphs",
"item_author" : [" Masahito Hasegawa "],
"item_description" : "Models of Sharing Graphs presents a sound mathematical basis for reasoning about models of computation involving shared resources, including graph rewriting systems, denotational semantics and concurrency theory. An algebraic approach, based on the language of category theory, is taken throughout this work, which enables the author to describe several aspects of the notion of sharing in a systematic way. In particular, a novel account of recursive computation created from cyclic sharing is developed using this framework.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/44/711/221/1447112210_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Models of Sharing Graphs : A Categorical Semantics of Let and Letrec
Overview
Models of Sharing Graphs presents a sound mathematical basis for reasoning about models of computation involving shared resources, including graph rewriting systems, denotational semantics and concurrency theory. An algebraic approach, based on the language of category theory, is taken throughout this work, which enables the author to describe several aspects of the notion of sharing in a systematic way. In particular, a novel account of recursive computation created from cyclic sharing is developed using this framework.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9781447112211
- ISBN-10: 1447112210
- Publisher: Springer
- Publish Date: October 2011
- Dimensions: 9.21 x 6.14 x 0.33 inches
- Shipping Weight: 0.49 pounds
- Page Count: 134
Related Categories
