↓ Skip to main content

TAPSOFT '91

Overview of attention for book
Cover of 'TAPSOFT '91'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Full abstraction for series-parallel pomsets
  3. Altmetric Badge
    Chapter 2 On causality observed incrementally, finally
  4. Altmetric Badge
    Chapter 3 On the domain of traces and sequential composition
  5. Altmetric Badge
    Chapter 4 Compilation of pattern matching with associative-commutative functions
  6. Altmetric Badge
    Chapter 5 Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties
  7. Altmetric Badge
    Chapter 6 Algebraic graph rewriting using a single pushout
  8. Altmetric Badge
    Chapter 7 Unifying initial and loose semantics of parameterized specifications in an arbitrary institution
  9. Altmetric Badge
    Chapter 8 Non-strict don't care algebras and specifications
  10. Altmetric Badge
    Chapter 9 Program specification and data refinement in type theory
  11. Altmetric Badge
    Chapter 10 Static analysis of linear congruence equalities among variables of a program
  12. Altmetric Badge
    Chapter 11 Simple solutions for approximate tree matching problems
  13. Altmetric Badge
    Chapter 12 The tree inclusion problem
  14. Altmetric Badge
    Chapter 13 Introducing a calculus of trees
  15. Altmetric Badge
    Chapter 14 Domains in a realizability framework
  16. Altmetric Badge
    Chapter 15 Iteration algebras extended abstract
  17. Altmetric Badge
    Chapter 16 Logic programming as hypergraph Rewriting
  18. Altmetric Badge
    Chapter 17 A fully abstract model for concurrent constraint programming
  19. Altmetric Badge
    Chapter 18 A solved form algorithm for ask and tell Herbrand constraints
  20. Altmetric Badge
    Chapter 19 A calculus of broadcasting systems
  21. Altmetric Badge
    Chapter 20 Object-based concurrency : A process calculus analysis
  22. Altmetric Badge
    Chapter 21 On the complexity of equation solving in process algebra
  23. Altmetric Badge
    Chapter 22 Comparative semantics for a real-time programming language with integration
  24. Altmetric Badge
    Chapter 23 A complete proof system for timed observations
  25. Altmetric Badge
    Chapter 24 Type inference with inequalities
Attention for Chapter 17: A fully abstract model for concurrent constraint programming
Altmetric Badge

Readers on

mendeley
7 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
A fully abstract model for concurrent constraint programming
Chapter number 17
Book title
TAPSOFT '91
Published by
Springer, Berlin, Heidelberg, April 1991
DOI 10.1007/3-540-53982-4_17
Book ISBNs
978-3-54-053982-7, 978-3-54-046563-8
Authors

Frank S. de Boer, Catuscia Palamidessi, de Boer, Frank S., Palamidessi, Catuscia

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 43%
Professor > Associate Professor 1 14%
Researcher 1 14%
Unknown 2 29%
Readers by discipline Count As %
Computer Science 5 71%
Unknown 2 29%