Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Existential quantifiers in abstract data types

Existential quantifiers in abstract data types

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 71/1979
BookAutomata, Languages and Programming
DOI10.1007/3-540-09510-1
Copyright1979
ISBN978-3-540-09510-1
DOI10.1007/3-540-09510-1_7
Pages73-87
Subject CollectionComputer Science
SpringerLink DateSaturday, January 21, 2006
Add to marked items

Existential quantifiers in abstract data types

M. Broy1, W. Dosch1, H. Partsch1, P. Pepper1 and M. Wirsing1

(1)  Institut für Informatik, Technische Universität München, Postfach 20 24 20, D-8000 München 2
Abstract
Hierarchies of abstract data types are specified by axioms which are positive formulas consisting of universally and existentially quantified disjunctions and conjunctions of equations. Necessary and sufficient conditions for the existence of terminal algebras are investigated. Furthermore, some advantages of disjunctions and existential quantifiers within the laws are discussed and the usefulness of terminal algebras is demonstrated by a few examples.
This research was carried out within the Sonderforschungsbereich 49, Programmiertechnik, Munich.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.112 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)