國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Foundations of software science and ...

(1998 :)

Foundations of software science and computation structures22nd 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 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Foundations of software science and computation structuresedited by Mikolaj Bojanczyk, Alex Simpson.
其他題名:	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 /
其他題名:	FOSSACS 2019
其他作者:	Bojanczyk, Mikolaj.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xv, 542 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer software
電子資源:	https://doi.org/10.1007/978-3-030-17127-8
ISBN:	9783030171278$q(electronic bk.)

Foundations of software science and computation structures22nd 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 /
Foundations of software science and computation structures22nd 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 /[electronic resource] :FOSSACS 2019edited by Mikolaj Bojanczyk, Alex Simpson. - Cham :Springer International Publishing :2019. - xv, 542 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,114250302-9743 ;. - Lecture notes in computer science ;4891..

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.

Open access.

This book is Open Access under a CC BY licence.

ISBN: 9783030171278$q(electronic bk.)

Standard No.: 10.1007/978-3-030-17127-8doiSubjects--Topical Terms:

252618
Computer software

LC Class. No.: QA76.751 / .F67 2019

Dewey Class. No.: 005.1

Foundations of software science and computation structures22nd 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 /
LDR:03407nmm a2200385 a 4500 001 554437
003 DE-He213
005 20190405005220.0
006 m d
007 cr nn 008maaau
008 191118s2019 gw s 0 eng d
020 $a 9783030171278$q(electronic bk.)
020 $a 9783030171261$q(paper)
024 7 $a 10.1007/978-3-030-17127-8 $2 doi
035 $a 978-3-030-17127-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.751 $b .F67 2019
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.751 $b .F751 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Foundations of software science and computation structures $h [electronic resource] : $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 / $c edited by Mikolaj Bojanczyk, Alex Simpson.
246 3 $a FOSSACS 2019
246 3 $a ETAPS 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xv, 542 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11425
490 1 $a Theoretical computer science and general issues
505 0 $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.
506 $a Open access.
520 $a This book is Open Access under a CC BY licence.
650 0 $a Computer software $3 252618
650 0 $a Software engineering $3 253562
650 1 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Programming Techniques. $3 274470
700 1 $a Bojanczyk, Mikolaj. $3 731316
700 1 $a Simpson, Alex. $3 836111
710 2 $a SpringerLink (Online service) $3 273601
711 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-17127-8
950 $a Computer Science (Springer-11645)