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

TAPSOFT '89

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 121 The varieties of programming language
  3. Altmetric Badge
    Chapter 122 Independence of negative constraints
  4. Altmetric Badge
    Chapter 123 Completion procedures as transition rules + control
  5. Altmetric Badge
    Chapter 124 A modular framework for specification and implementation
  6. Altmetric Badge
    Chapter 125 On the existence of initial models for partial (higher-order) conditional specifications
  7. Altmetric Badge
    Chapter 126 Terms and infinite trees as monads over a signature
  8. Altmetric Badge
    Chapter 127 The subsequence graph of a text
  9. Altmetric Badge
    Chapter 128 Syntactical properties of unbounded nets of processors
  10. Altmetric Badge
    Chapter 129 Shuffle equations, parallel transition systems and equational Petri nets
  11. Altmetric Badge
    Chapter 130 Towards a lambda-calculus for concurrent and communicating systems
  12. Altmetric Badge
    Chapter 131 A distributed, net oriented semantics for Delta Prolog
  13. Altmetric Badge
    Chapter 132 Continuation semantics for PROLOG with cut
  14. Altmetric Badge
    Chapter 133 Labeled trees and relations on generating functions
  15. Altmetric Badge
    Chapter 134 Proofs of declarative properties of logic programs
  16. Altmetric Badge
    Chapter 135 The reachability problem for ground TRS and some extensions
  17. Altmetric Badge
    Chapter 136 Order-sorted completion: The many-sorted way
  18. Altmetric Badge
    Chapter 137 Algebraization and integrity constraints for an extended entity-relationship approach
  19. Altmetric Badge
    Chapter 138 Decidable boundedness problems for hyperedge-replacement graph grammars
  20. Altmetric Badge
    Chapter 139 Implementation of parameterized observational specifications
  21. Altmetric Badge
    Chapter 140 Priority controlled incremental attribute evaluation in attributed graph grammars
  22. Altmetric Badge
    Chapter 141 Some applications and techniques for generating functions
  23. Altmetric Badge
    Chapter 142 Semi-constructive formal systems and axiomatization of abstract data types
  24. Altmetric Badge
    Chapter 143 Inductive proofs by resolution and paramodulation
  25. Altmetric Badge
    Chapter 144 Local model checking in the modal mu-calculus
Attention for Chapter 132: Continuation semantics for PROLOG with cut
Altmetric Badge

Readers on

mendeley
3 Mendeley
Summary
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
Continuation semantics for PROLOG with cut
Chapter number 132
Book title
TAPSOFT '89
Published by
Springer, Berlin, Heidelberg, March 1989
DOI 10.1007/3-540-50939-9_132
Book ISBNs
978-3-54-050939-4, 978-3-54-046116-6
Authors

A. de Bruin, E. P. de Vink, Bruin, A. de, Vink, E. P. de, de Bruin, A., de Vink, E. P.

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 33%
Professor > Associate Professor 1 33%
Unknown 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Unknown 1 33%

This page is provided by Altmetric.