↓ Skip to main content

Trees in Algebra and Programming — CAAP '96

Overview of attention for book
Cover of 'Trees in Algebra and Programming — CAAP '96'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 24 Semantics of interaction
  3. Altmetric Badge
    Chapter 25 The Kronecker product and local computations in graphs
  4. Altmetric Badge
    Chapter 26 Iterative pairs and multitape automata
  5. Altmetric Badge
    Chapter 27 Diophantine equations, Presburger arithmetic and finite automata
  6. Altmetric Badge
    Chapter 28 A pumping lemma for output languages of macro tree transducers
  7. Altmetric Badge
    Chapter 29 The area determined by underdiagonal lattice paths
  8. Altmetric Badge
    Chapter 30 Extraction of concurrent processes from higher dimensional automata
  9. Altmetric Badge
    Chapter 31 Axiomatising extended computation tree logic
  10. Altmetric Badge
    Chapter 32 Final semantics for a higher order concurrent language
  11. Altmetric Badge
    Chapter 33 The practice of logical frameworks
  12. Altmetric Badge
    Chapter 34 Subsumption algorithms based on search trees
  13. Altmetric Badge
    Chapter 35 Interaction nets and term rewriting systems (extended abstract)
  14. Altmetric Badge
    Chapter 36 Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
  15. Altmetric Badge
    Chapter 37 Relative normalization in Deterministic Residual Structures
  16. Altmetric Badge
    Chapter 38 Termination by absence of infinite chains of dependency pairs
  17. Altmetric Badge
    Chapter 39 Confluence without termination via parallel critical pairs
  18. Altmetric Badge
    Chapter 40 An ordinal calculus for proving termination in term rewriting
  19. Altmetric Badge
    Chapter 41 Behavioural satisfaction and equivalence in concrete model categories
  20. Altmetric Badge
    Chapter 42 Open maps, behavioural equivalences, and congruences
  21. Altmetric Badge
    Chapter 43 Denotational, causal, and operational determinism in event structures
  22. Altmetric Badge
    Chapter 44 Effective longest and infinite reduction paths in untyped λ-calculi
  23. Altmetric Badge
    Chapter 45 Full abstraction for lambda calculus with resources and convergence testing
  24. Altmetric Badge
    Chapter 46 Untyped lambda-calculus with input-output
Attention for Chapter 24: Semantics of interaction
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
38 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.
Chapter title
Semantics of interaction
Chapter number 24
Book title
Trees in Algebra and Programming — CAAP '96
Published in
Lecture notes in computer science, June 2005
DOI 10.1007/3-540-61064-2_24
Book ISBNs
978-3-54-061064-9, 978-3-54-049944-2
Authors

Samson Abramsky

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Italy 2 5%
United Kingdom 2 5%
Canada 1 3%
New Zealand 1 3%
United States 1 3%
Unknown 31 82%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 15 39%
Researcher 6 16%
Professor > Associate Professor 4 11%
Student > Bachelor 3 8%
Student > Master 3 8%
Other 5 13%
Unknown 2 5%
Readers by discipline Count As %
Computer Science 25 66%
Mathematics 4 11%
Philosophy 3 8%
Physics and Astronomy 2 5%
Environmental Science 1 3%
Other 1 3%
Unknown 2 5%