menu
{ "item_title" : "Coalgebraic Methods in Computer Science", "item_author" : [" Corina Cîrstea "], "item_description" : "Relating Structure and Power: Comonadic Semantics for Computational Resources.- Coalgebraic Logics and Duality.- Intuitionistic Podelski-Rybalchenko Theorem and Equivalence between Inductive Definitions and Cyclic Proofs.- Undecidability of Equality for Codata Types.- Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.- Long-Term Values in Markov Decision Processes, (Co)Algebraically.- (In)finite Trace Equivalence of Probabilistic Transition Systems.- Steps and Traces.- On Algebras with Effectful Iteration.- Monoidal computer III: A coalgebraic view of computability and complexity.- Fibrational Bisimulations and Quantitative Reasoning.- Categorical B chi and Parity Conditions via Alternating Fixed Points of Functors.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/000/388/3030003884_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" : "" } }
Coalgebraic Methods in Computer Science|Corina Cîrstea

Coalgebraic Methods in Computer Science : 14th Ifip Wg 1.3 International Workshop, Cmcs 2018, Colocated with Etaps 2018, Thessaloniki, Greece, April 14

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Relating Structure and Power: Comonadic Semantics for Computational Resources.- Coalgebraic Logics and Duality.- Intuitionistic Podelski-Rybalchenko Theorem and Equivalence between Inductive Definitions and Cyclic Proofs.- Undecidability of Equality for Codata Types.- Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages.- Long-Term Values in Markov Decision Processes, (Co)Algebraically.- (In)finite Trace Equivalence of Probabilistic Transition Systems.- Steps and Traces.- On Algebras with Effectful Iteration.- Monoidal computer III: A coalgebraic view of computability and complexity.- Fibrational Bisimulations and Quantitative Reasoning.- Categorical B chi and Parity Conditions via Alternating Fixed Points of Functors.

This item is Non-Returnable

Details

  • ISBN-13: 9783030003883
  • ISBN-10: 3030003884
  • Publisher: Springer
  • Publish Date: September 2018
  • Dimensions: 9.21 x 6.14 x 0.52 inches
  • Shipping Weight: 0.78 pounds
  • Page Count: 235

Related Categories

You May Also Like...

    1

BAM Customer Reviews