↓ Skip to main content

Foundations of Software Science and Computation Structures

Overview of attention for book
Cover of 'Foundations of Software Science and Computation Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Coherence Spaces and Uniform Continuity
  3. Altmetric Badge
    Chapter 2 The Free Exponential Modality of Probabilistic Coherence Spaces
  4. Altmetric Badge
    Chapter 3 From Qualitative to Quantitative Semantics
  5. Altmetric Badge
    Chapter 4 Almost Every Simply Typed $$\lambda $$ -Term Has a Long $$\beta $$ -Reduction Sequence
  6. Altmetric Badge
    Chapter 5 Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
  7. Altmetric Badge
    Chapter 6 Equational Theories of Abnormal Termination Based on Kleene Algebra
  8. Altmetric Badge
    Chapter 7 Companions, Codensity and Causality
  9. Altmetric Badge
    Chapter 8 Nominal Automata with Name Binding
  10. Altmetric Badge
    Chapter 9 On the Existence of Weak Subgame Perfect Equilibria
  11. Altmetric Badge
    Chapter 10 Optimal Reachability in Divergent Weighted Timed Games
  12. Altmetric Badge
    Chapter 11 Bounding Average-Energy Games
  13. Altmetric Badge
    Chapter 12 Logics of Repeating Values on Data Trees and Branching Counter Systems
  14. Altmetric Badge
    Chapter 13 Degree of Sequentiality of Weighted Automata
  15. Altmetric Badge
    Chapter 14 Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
  16. Altmetric Badge
    Chapter 15 Partial Derivatives for Context-Free Languages
  17. Altmetric Badge
    Chapter 16 Dynamic Complexity of the Dyck Reachability
  18. Altmetric Badge
    Chapter 17 Cyclic Arithmetic Is Equivalent to Peano Arithmetic
  19. Altmetric Badge
    Chapter 18 Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
  20. Altmetric Badge
    Chapter 19 On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
  21. Altmetric Badge
    Chapter 20 Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables
  22. Altmetric Badge
    Chapter 21 Pointless Learning
  23. Altmetric Badge
    Chapter 22 On Higher-Order Probabilistic Subrecursion
  24. Altmetric Badge
    Chapter 23 A Truly Concurrent Game Model of the Asynchronous \(\pi \)-Calculus
  25. Altmetric Badge
    Chapter 24 Local Model Checking in a Logic for True Concurrency
  26. Altmetric Badge
    Chapter 25 The Paths to Choreography Extraction
  27. Altmetric Badge
    Chapter 26 On the Undecidability of Asynchronous Session Subtyping
  28. Altmetric Badge
    Chapter 27 A Lambda-Free Higher-Order Recursive Path Order
  29. Altmetric Badge
    Chapter 28 Automated Constructivization of Proofs
  30. Altmetric Badge
    Chapter 29 A Light Modality for Recursion
  31. Altmetric Badge
    Chapter 30 Unifying Guarded and Unguarded Iteration
  32. Altmetric Badge
    Chapter 31 Partiality, Revisited
  33. Altmetric Badge
    Chapter 32 On the Semantics of Intensionality
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (81st percentile)
  • High Attention Score compared to outputs of the same age and source (93rd percentile)

Mentioned by

twitter
19 tweeters
facebook
1 Facebook page
reddit
1 Redditor

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Foundations of Software Science and Computation Structures
Published by
Lecture notes in computer science, January 2017
DOI 10.1007/978-3-662-54458-7
ISBNs
978-3-66-254457-0, 978-3-66-254458-7
Editors

Esparza Javier, Murawski Andrzej S.

Twitter Demographics

The data shown below were collected from the profiles of 19 tweeters who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 100%
Readers by discipline Count As %
Computer Science 1 100%

Attention Score in Context

This research output has an Altmetric Attention Score of 10. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 22 January 2020.
All research outputs
#1,974,272
of 15,568,240 outputs
Outputs from Lecture notes in computer science
#567
of 7,582 outputs
Outputs of similar age
#49,724
of 267,085 outputs
Outputs of similar age from Lecture notes in computer science
#8
of 119 outputs
Altmetric has tracked 15,568,240 research outputs across all sources so far. Compared to these this one has done well and is in the 87th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 7,582 research outputs from this source. They receive a mean Attention Score of 4.5. This one has done particularly well, scoring higher than 92% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 267,085 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 81% of its contemporaries.
We're also able to compare this research output to 119 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 93% of its contemporaries.