Non-deterministic data types: models and implementations

@article{Nipkow1986NondeterministicDT,
  title={Non-deterministic data types: models and implementations},
  author={Tobias Nipkow},
  journal={Acta Informatica},
  year={1986},
  volume={22},
  pages={629-661}
}
SummaryThe model theoretic basis for (abstract) data types is generalized from algebras to multi-algebr as in order to cope with non-deterministic operations. A programming oriented definition and a model theoretic criterion (called simulation) for implementation of data types are given. To justify the criterion w.r.t. the definition, an abstract framework linking denotational semantics of programming languages and model theory of data types is set up. A set of constraints on a programming… CONTINUE READING

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

1986
2013

CITATION STATISTICS

  • 3 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

Fixed PointTheory for Communication and Concurrency

  • Formal Description of Programming Concepts
  • 1982
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Systemes Relationnels Et Algebres Multiformes

G. Hansoul
  • PhD Thesis, Universite de Liege,
  • 1979
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Bisimulations and Abstraction Homomorphisms

  • J. Comput. Syst. Sci.
  • 1987
VIEW 2 EXCERPTS

Initial Restrictions of Behaviour

H. Reichel
  • Proc. IFIP Working Conference. The Role of Abstract Models in Information Processing,
  • 1985
VIEW 1 EXCERPT

Nondeterministic Data Types: Models and Implementations

T. Nipkow
  • Draft Version, Dept. of Computer Science,
  • 1985
VIEW 1 EXCERPT

Combining Initial and Loose Algebraic Specification Methods Including Compositionality and Modules

H. Ehrig
  • Proc. Workshop on Formal Software Development: Combining Specification Methods,
  • 1984
VIEW 1 EXCERPT