Language:
English
繁體中文
Help
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Foundations of Software Science and ...
~
SpringerLink (Online service)
Foundations of Software Science and Computation Structures = 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
Record Type:
Language materials, printed : Monograph/item
Title/Author:
Foundations of Software Science and Computation Structures/ edited by Andrew Pitts.
Reminder of title:
18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
other author:
Pitts, Andrew.
Description:
XVI, 465 p. 92 illus.online resource. :
Contained By:
Springer Nature eBook
Subject:
Computer logic. -
Online resource:
https://doi.org/10.1007/978-3-662-46678-0
ISBN:
9783662466780
Foundations of Software Science and Computation Structures = 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
Foundations of Software Science and Computation Structures
18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /[electronic resource] :edited by Andrew Pitts. - 1st ed. 2015. - XVI, 465 p. 92 illus.online resource. - Theoretical Computer Science and General Issues ;9034. - Theoretical Computer Science and General Issues ;9163.
Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic.
This book constitutes the proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2015, held in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 28 full papers presented in this volume were carefully reviewed and selected from 93 submissions. They are organized in topical sections named: semantics of programming languages; categorical models and logics; concurrent, probabilistic and timed systems; automata, games, verification; logical aspects of computational complexity; and type theory, proof theory and implicit computational complexity. The book also contains one full paper invited talk.
ISBN: 9783662466780
Standard No.: 10.1007/978-3-662-46678-0doiSubjects--Topical Terms:
786340
Computer logic.
LC Class. No.: QA76.9.L63
Dewey Class. No.: 005.1015113
Foundations of Software Science and Computation Structures = 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
LDR
:04209nam a22004335i 4500
001
969368
003
DE-He213
005
20200704084635.0
007
cr nn 008mamaa
008
201211s2015 gw | s |||| 0|eng d
020
$a
9783662466780
$9
978-3-662-46678-0
024
7
$a
10.1007/978-3-662-46678-0
$2
doi
035
$a
978-3-662-46678-0
050
4
$a
QA76.9.L63
050
4
$a
QA76.5913
072
7
$a
UM
$2
bicssc
072
7
$a
COM051000
$2
bisacsh
072
7
$a
UM
$2
thema
072
7
$a
UYF
$2
thema
082
0 4
$a
005.1015113
$2
23
245
1 0
$a
Foundations of Software Science and Computation Structures
$h
[electronic resource] :
$b
18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings /
$c
edited by Andrew Pitts.
250
$a
1st ed. 2015.
264
1
$a
Berlin, Heidelberg :
$b
Springer Berlin Heidelberg :
$b
Imprint: Springer,
$c
2015.
300
$a
XVI, 465 p. 92 illus.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Theoretical Computer Science and General Issues ;
$v
9034
505
0
$a
Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic.
520
$a
This book constitutes the proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2015, held in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 28 full papers presented in this volume were carefully reviewed and selected from 93 submissions. They are organized in topical sections named: semantics of programming languages; categorical models and logics; concurrent, probabilistic and timed systems; automata, games, verification; logical aspects of computational complexity; and type theory, proof theory and implicit computational complexity. The book also contains one full paper invited talk.
650
0
$a
Computer logic.
$3
786340
650
0
$a
Mathematical logic.
$2
bicssc
$3
810627
650
0
$a
Programming languages (Electronic computers).
$3
1127615
650
0
$a
Software engineering.
$3
562952
650
0
$a
Computers.
$3
565115
650
1 4
$a
Logics and Meanings of Programs.
$3
670058
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
670059
650
2 4
$a
Programming Languages, Compilers, Interpreters.
$3
669782
650
2 4
$a
Software Engineering.
$3
669632
650
2 4
$a
Computation by Abstract Devices.
$3
669792
700
1
$a
Pitts, Andrew.
$e
editor.
$1
https://orcid.org/0000-0001-7775-3471
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1264922
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783662466797
776
0 8
$i
Printed edition:
$z
9783662466773
830
0
$a
Theoretical Computer Science and General Issues ;
$v
9163
$3
1253524
856
4 0
$u
https://doi.org/10.1007/978-3-662-46678-0
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
912
$a
ZDB-2-LNC
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login