My Account Log in

1 option

Coalgebraic Methods in Computer Science : 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers / edited by Ichiro Hasuo.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Hasuo, Ichirō, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9608
Theoretical Computer Science and General Issues, 2512-2029 ; 9608
Language:
English
Subjects (All):
Machine theory.
Computer science.
Artificial intelligence.
Formal Languages and Automata Theory.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Local Subjects:
Formal Languages and Automata Theory.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Artificial Intelligence.
Physical Description:
1 online resource (IX, 235 pages) : 5 illustrations
Edition:
1st ed. 2016.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2016.
System Details:
text file PDF
Summary:
This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2016, colocated with ETAPS 2016, held in Eindhoven, The Netherlands, in April 2016. The 10 revised full papers were carefully reviewed and selected from 13 submissions. Also included are an invited paper and two keynote talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.
Contents:
Fixed Points of Functors - A Survey
Compositional Coinduction with Sized Types
Lawvere Theories as Composed PROPs
Transitivity and Difunctionality of Bisimulations
Affine Monads and Side-Effect-Freeness
Duality of Equations and Coequations via Contravariant Adjunctions
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness
Product Rules and Distributive Laws
On the Logic of Generalised Metric Spaces
A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
Coalgebraic Completeness-via-Canonicity: Principles and Applications
Relational Lattices via Duality
On Local Characterization of Global Timed Bisimulation for Abstract.
Other Format:
Printed edition:
ISBN:
978-3-319-40370-0
9783319403700
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.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account