A compositional approach to superimposition

  • Authors:
  • L. Bougé;N. Francez

  • Affiliations:
  • LIENS, 45 Rue d'Ulm, F75230 Paris Cedex 05, France, LIFO, Université d'Orléans, BP 6759, F45067 Orléans, France;Computer Science Department, Technion, Haifa 32000, Israel

  • Venue:
  • POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 1988

Quantified Score

Hi-index 0.02

Visualization

Abstract

A general definition of the notion of superimposition is presented. We show that previous constructions under the same name can be seen as special cases of our definition. We consider several properties of superimposition definable in our terms, notably the nonfreezing property. We also consider a syntactic representation of our construct in CSP