Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Foundations of software science and ...
~
Pitts, Andrew.
Linked to FindBook
Google Book
Amazon
博客來
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:
Electronic resources : 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 /
remainder title:
FOSSACS 2015
other author:
Pitts, Andrew.
Published:
Berlin, Heidelberg :Springer Berlin Heidelberg : : 2015.,
Description:
xvi, 465 p. :ill., digital ;24 cm.
[NT 15003449]:
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.
Contained By:
Springer eBooks
Subject:
Computer software -
Online resource:
http://dx.doi.org/10.1007/978-3-662-46678-0
ISBN:
9783662466780 (electronic bk.)
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] :FOSSACS 2015edited by Andrew Pitts. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xvi, 465 p. :ill., digital ;24 cm. - Lecture notes in computer science,90340302-9743 ;. - Lecture notes in computer science ;5353..
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 (electronic bk.)
Standard No.: 10.1007/978-3-662-46678-0doiSubjects--Topical Terms:
950579
Computer software
LC Class. No.: QA76.751
Dewey Class. No.: 005.1
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
:03900nmm a2200373 a 4500
001
1997860
003
DE-He213
005
20151023141437.0
006
m d
007
cr nn 008maaau
008
151112s2015 gw s 0 eng d
020
$a
9783662466780 (electronic bk.)
020
$a
9783662466773 (paper)
024
7
$a
10.1007/978-3-662-46678-0
$2
doi
035
$a
978-3-662-46678-0
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.751
072
7
$a
UM
$2
bicssc
072
7
$a
UYF
$2
bicssc
072
7
$a
COM051000
$2
bisacsh
072
7
$a
COM036000
$2
bisacsh
082
0 4
$a
005.1
$2
23
090
$a
QA76.751
$b
.F751 2015
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.
246
3
$a
FOSSACS 2015
246
3
$a
ETAPS 2015
260
$a
Berlin, Heidelberg :
$b
Springer Berlin Heidelberg :
$b
Imprint: Springer,
$c
2015.
300
$a
xvi, 465 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$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 software
$2
sigle
$3
950579
650
0
$a
Software engineering
$v
Congresses.
$3
1243492
650
1 4
$a
Computer Science.
$3
626642
650
2 4
$a
Logics and Meanings of Programs.
$3
892495
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
892517
650
2 4
$a
Programming Languages, Compilers, Interpreters.
$3
891123
650
2 4
$a
Software Engineering.
$3
890874
650
2 4
$a
Computation by Abstract Devices.
$3
891207
700
1
$a
Pitts, Andrew.
$3
2139214
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
5353.
$x
0302-9743
$3
1274248
856
4 0
$u
http://dx.doi.org/10.1007/978-3-662-46678-0
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9268571
電子資源
01.外借(書)_YB
電子書
EB QA76.751 .F751 2015
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login