My Account Log in

1 option

Coalgebraic Methods in Computer Science : 14th IFIP WG 1.3 International Workshop, CMCS 2018, Colocated with ETAPS 2018, Thessaloniki, Greece, April 14-15, 2018, Revised Selected Papers / edited by Corina Cîrstea.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Cîrstea, Corina, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 11202.
Theoretical Computer Science and General Issues ; 11202
Language:
English
Subjects (All):
Logic, Symbolic and mathematical.
Artificial intelligence.
Computer logic.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Logics and Meanings of Programs.
Local Subjects:
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Logics and Meanings of Programs.
Physical Description:
1 online resource (IX, 235 pages) : 4 illustrations.
Edition:
First edition 2018.
Contained In:
Springer eBooks
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2018.
System Details:
text file PDF
Summary:
This book constitutes the thoroughly refereed post-conference proceedings of the 14th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2018, colocated with ETAPS 2018, held in Thessaloniki, Greece, in April 2018. The 10 revised full papers were carefully reviewed and selected from 17 submissions. Also included are the extended abstracts of two keynotes/invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-030-00389-0
9783030003890
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account