Skip to main navigation Skip to search Skip to main content

Existential quantifiers in abstract data types

  • M. Broy
  • , W. Dosch
  • , H. Partsch
  • , P. Pepper
  • , M. Wirsing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Scopus citations

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 6th Colloquium
EditorsHermann A. Maurer
PublisherSpringer Verlag
Pages73-87
Number of pages15
ISBN (Print)9783540095101
DOIs
StatePublished - 1979
Event6th International Colloquium on Automata, Languages and Programming, ICALP 1979 - Graz, Austria
Duration: 16 Jul 197920 Jul 1979

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume71 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Colloquium on Automata, Languages and Programming, ICALP 1979
Country/TerritoryAustria
CityGraz
Period16/07/7920/07/79

Fingerprint

Dive into the research topics of 'Existential quantifiers in abstract data types'. Together they form a unique fingerprint.

Cite this