↓ Skip to main content
What is this page? Embed badge

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 (86th percentile)
  • High Attention Score compared to outputs of the same age and source (86th percentile)

Mentioned by

twitter
23 X users
facebook
1 Facebook page
reddit
1 Redditor

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 Mendeley
Summary X Facebook Reddit Dimensions citations
So far, Dimensions has found 3 publications that cite this research output.

3

The most recent citing publications are shown below. View all 3 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.