Foundations of Software Science and Computation Structures : : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings / / edited by Mikołaj Bojańczyk, Alex Simpson.

This book is Open Access under a CC BY licence.

Saved in:
Bibliographic Details
Superior document:Theoretical Computer Science and General Issues, 11425
HerausgeberIn:
Place / Publishing House:Cham : : Springer International Publishing :, Imprint: Springer,, 2019.
Year of Publication:2019
Edition:1st ed. 2019.
Language:English
Series:Theoretical Computer Science and General Issues, 11425
Physical Description:1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993546821404498
ctrlnum (CKB)4100000007881202
(DE-He213)978-3-030-17127-8
(MiAaPQ)EBC5919832
(Au-PeEL)EBL5919832
(OCoLC)1096283475
(oapen)https://directory.doabooks.org/handle/20.500.12854/26387
(PPN)235668435
(EXLCZ)994100000007881202
collection bib_alma
record_format marc
spelling Bojańczyk, Mikołaj edt
Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings / edited by Mikołaj Bojańczyk, Alex Simpson.
1st ed. 2019.
Cham : Springer International Publishing : Imprint: Springer, 2019.
1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Theoretical Computer Science and General Issues, 2512-2029 ; 11425
Open Access
English
Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.
This book is Open Access under a CC BY licence.
Machine theory.
Artificial intelligence.
Computer science—Mathematics.
Discrete mathematics.
Artificial intelligence—Data processing.
Compilers (Computer programs).
Computer programming.
Formal Languages and Automata Theory.
Artificial Intelligence.
Discrete Mathematics in Computer Science.
Data Science.
Compilers and Interpreters.
Programming Techniques.
3-030-17126-4
Bojańczyk, Mikołaj. editor. edt http://id.loc.gov/vocabulary/relators/edt
Simpson, Alex. editor. edt http://id.loc.gov/vocabulary/relators/edt
language English
format eBook
author2 Bojańczyk, Mikołaj.
Bojańczyk, Mikołaj.
Simpson, Alex.
Simpson, Alex.
author_facet Bojańczyk, Mikołaj.
Bojańczyk, Mikołaj.
Simpson, Alex.
Simpson, Alex.
author2_variant m b mb
m b mb
m b mb
a s as
a s as
author2_role HerausgeberIn
HerausgeberIn
HerausgeberIn
HerausgeberIn
author_sort Bojańczyk, Mikołaj.
title Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /
spellingShingle Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /
Theoretical Computer Science and General Issues,
Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.
title_sub 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /
title_full Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings / edited by Mikołaj Bojańczyk, Alex Simpson.
title_fullStr Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings / edited by Mikołaj Bojańczyk, Alex Simpson.
title_full_unstemmed Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings / edited by Mikołaj Bojańczyk, Alex Simpson.
title_auth Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /
title_new Foundations of Software Science and Computation Structures :
title_sort foundations of software science and computation structures : 22nd international conference, fossacs 2019, held as part of the european joint conferences on theory and practice of software, etaps 2019, prague, czech republic, april 6–11, 2019, proceedings /
series Theoretical Computer Science and General Issues,
series2 Theoretical Computer Science and General Issues,
publisher Springer International Publishing : Imprint: Springer,
publishDate 2019
physical 1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)
edition 1st ed. 2019.
contents Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.
isbn 3-030-17127-2
3-030-17126-4
issn 2512-2029 ;
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA8
callnumber-sort QA 18.9 Q A10 13
illustrated Not Illustrated
dewey-hundreds 000 - Computer science, information & general works
dewey-tens 000 - Computer science, knowledge & systems
dewey-ones 005 - Computer programming, programs & data
dewey-full 005.131
005.1
dewey-sort 15.131
dewey-raw 005.131
005.1
dewey-search 005.131
005.1
oclc_num 1096283475
work_keys_str_mv AT bojanczykmikołaj foundationsofsoftwarescienceandcomputationstructures22ndinternationalconferencefossacs2019heldaspartoftheeuropeanjointconferencesontheoryandpracticeofsoftwareetaps2019pragueczechrepublicapril6112019proceedings
AT simpsonalex foundationsofsoftwarescienceandcomputationstructures22ndinternationalconferencefossacs2019heldaspartoftheeuropeanjointconferencesontheoryandpracticeofsoftwareetaps2019pragueczechrepublicapril6112019proceedings
status_str n
ids_txt_mv (CKB)4100000007881202
(DE-He213)978-3-030-17127-8
(MiAaPQ)EBC5919832
(Au-PeEL)EBL5919832
(OCoLC)1096283475
(oapen)https://directory.doabooks.org/handle/20.500.12854/26387
(PPN)235668435
(EXLCZ)994100000007881202
carrierType_str_mv cr
hierarchy_parent_title Theoretical Computer Science and General Issues, 11425
hierarchy_sequence 11425
is_hierarchy_title Foundations of Software Science and Computation Structures : 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /
container_title Theoretical Computer Science and General Issues, 11425
author2_original_writing_str_mv noLinkedField
noLinkedField
noLinkedField
noLinkedField
_version_ 1804719270474547200
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04560nam a22006375i 4500</leader><controlfield tag="001">993546821404498</controlfield><controlfield tag="005">20230329173152.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr#nn#008mamaa</controlfield><controlfield tag="008">190405s2019 sz | o |||| 0|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3-030-17127-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-030-17127-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)4100000007881202</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)978-3-030-17127-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC5919832</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL5919832</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1096283475</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/26387</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PPN)235668435</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)994100000007881202</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA8.9-QA10.3</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UYA</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UYA</subfield><subfield code="2">thema</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">005.131</subfield><subfield code="2">23</subfield></datafield><datafield tag="082" ind1=" " ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bojańczyk, Mikołaj</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Foundations of Software Science and Computation Structures :</subfield><subfield code="b">22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings /</subfield><subfield code="c">edited by Mikołaj Bojańczyk, Alex Simpson.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2019.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer International Publishing :</subfield><subfield code="b">Imprint: Springer,</subfield><subfield code="c">2019.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (XV, 542 p. 2401 illus., 6 illus. in color.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Theoretical Computer Science and General Issues,</subfield><subfield code="x">2512-2029 ;</subfield><subfield code="v">11425</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">Open Access</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Universal Graphs and Good for Small Games Automata: New Tools for Infinite Duration Games -- Resource-Tracking Concurrent Games -- Change Actions: Models of Generalised Differentiation -- Coalgebra Learning via Duality -- Tight Worst-Case Bounds for Polynomial Loop Programs -- A Complete Normal-Form Bisimilarity for State -- Identifiers in Registers - Describing Network Algorithms with Logic -- The Impatient May Use Limited Optimism to Minimize Regret -- Causality in Linear Logic: Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) -- Rewriting Abstract Structures: Materialization Explained Categorically -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- Kleene Algebra with Hypotheses -- Trees in Partial Higher Dimensional Automata -- The Bernays-Schoenfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- Optimal Satisfiability Checking for Arithmetic mu-Calculi -- Constructing Inductive-Inductive Types in Cubical Type Theory -- Causal Inference by String Diagram Surgery -- Higher-Order Distributions for Differential Linear Logic -- Languages Ordered by the Subword Order -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- A Sound and Complete Logic for Algebraic Effects -- Equational Axiomatization of Algebras with Structure -- Towards a Structural Proof Theory of Probabilistic μ-Calculi -- Partial and Conditional Expectations in Markov Decision Processes with Integer Weights -- Equational Theories and Monads from Polynomial Cayley Representations -- A Dialectica-Like Interpretation of a Linear MSO on Infinite Words -- Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time -- Justness: A Completeness Criterion for Capturing Liveness Properties -- Path category for Free - Open Morphisms from Coalgebras with Non-Deterministic Branching.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book is Open Access under a CC BY licence.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Artificial intelligence.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science—Mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Discrete mathematics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Artificial intelligence—Data processing.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Compilers (Computer programs).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer programming.</subfield></datafield><datafield tag="650" ind1="1" ind2="4"><subfield code="a">Formal Languages and Automata Theory.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Artificial Intelligence.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Discrete Mathematics in Computer Science.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Data Science.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Compilers and Interpreters.</subfield></datafield><datafield tag="650" ind1="2" ind2="4"><subfield code="a">Programming Techniques.</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-030-17126-4</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bojańczyk, Mikołaj.</subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Simpson, Alex.</subfield><subfield code="e">editor.</subfield><subfield code="4">edt</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/edt</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Theoretical Computer Science and General Issues,</subfield><subfield code="x">2512-2029 ;</subfield><subfield code="v">11425</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-07-16 07:52:37 Europe/Vienna</subfield><subfield code="d">00</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2019-04-13 22:04:18 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5338359010004498&amp;Force_direct=true</subfield><subfield code="Z">5338359010004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338359010004498</subfield></datafield></record></collection>