article

Free access

Algebraic implementation of abstract data types: an announcement

Authors:

H. Ehrig,

H. J. Kreowski,

P. PadawitzAuthors Info & Claims

ACM SIGACT News, Volume 11, Issue 2

Pages 25 - 29

https://doi.org/10.1145/1008620.1008622

Published: 01 September 1979 Publication History

PDF eReader

Abstract

A new concept for the implementation of abstract data types is proposed: Given algebraic specifications SPECO and SPEC1 of abstract data types ADTO and ADT1 an implementation of ADTO by ADT1 is defined separately on the syntactical level of specifications and on the semantical level of algebras. In addition to a short overview a simple example is provided.

References

[1]

/ADJ 76/ Goguen, J. A. - Thatcher, J. W. - Wagner, E. G.: An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, IBM Research Report RC-6487, 1976; und in: Current Trends in Programming Methodology, IV: Data Structuring (R. Yeh Ed.), Prentice Hall, New Jersey, 1978.

Google Scholar

[2]

/Eh 78/ Ehrich, H.-D.: On the Theory of Specification, Implementation and Parametrization of Abstract Data Types, Forschungsbericht Dortmund, 1978.

Google Scholar

[3]

/EKP 78/ Ehrig, H. - Kreowski, H.-J. - Padawitz, P.: Stepwise Specification and Implementation of Abstract Data Types, Proc. 5. Int. Colloq. on Automata, Languages and Programming, Udine 1978.

Digital Library

Google Scholar

[4]

/EKP 79/ Ehrig, H: Algebraische Implementierung abstrakter Datentypen, Forschungsbericht TU Berlin, FB 20, 1979.

Google Scholar

[5]

/EKW 78/ Ehrig, H. - Kreowski, H.-J. - Weber, H.: Algebraic Specification Schemes for Data Base Systems, Proc. 4. Int. Conf. on Very Large Data Bases, Berlin, 1978.

Google Scholar

[6]

/GN 78/ Goguen, J. A. - Nourani, F.: Some Algebraic Techniques for Proving Correctness of Data Type Implementation, Extended Abstract, Comp. Sci. Dept., UCLA, Los Angeles, 1978.

Google Scholar

[7]

/Gut 76/ Guttag, J. V.: Abstract Data Types and the Development of Data Structures, Supplement to Proc. Conf. on Data Abstraction, Definition, and Structure, SIGPLAN Notices 8, March 1976.

Digital Library

Google Scholar

[8]

/LS 77/ Lehmann, D. J. - Smyth, M. B.: Data Types, Univ. of Warwick, Dept. of Comp. Sci., Report No. 19, 1977.

Digital Library

Google Scholar

[9]

/Wa 77/ Wand, M.: Final Algebra Semantics and Data Type Extensions, Indiana Univ., Comp. Sci. Dept., Technical Report No. 65, 1977

Google Scholar

Cited By

View all

Bidoit M(2005)The stratified loose approach: A generalization of initial and loose semanticsRecent Trends in Data Type Specification10.1007/3-540-50325-0_1(1-22)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-50325-0_1
Gaudel MMoineau T(2005)A theory of software reusabilityESOP '8810.1007/3-540-19027-9_8(115-130)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-19027-9_8
Bernot G(2005)Good functors ... are those preserving philosophy!Category Theory and Computer Science10.1007/3-540-18508-9_26(182-195)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-18508-9_26
Show More Cited By

Algebraic implementation of abstract data types: an announcement
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Direct Implementation of Algebraic Specification of Abstract Data Types

Algebraic specification is now an established way of formally defining abstract data types. For its practical use, however, a segment of program which conforms with the specification has to be generated. Such program segments can be manually produced ...
AUTOMATIC SYNTHESIS OF IMPLEMENTATION FOR ABSTRACT DATA TYPES FROM ALGEBRAIC SPECIFICATIONS
Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 11, Issue 2

Fall 1979

38 pages

ISSN:0163-5700

DOI:10.1145/1008620

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1979

Published in SIGACT Volume 11, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
262
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)13

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bidoit M(2005)The stratified loose approach: A generalization of initial and loose semanticsRecent Trends in Data Type Specification10.1007/3-540-50325-0_1(1-22)Online publication date: 26-May-2005
https://doi.org/10.1007/3-540-50325-0_1
Gaudel MMoineau T(2005)A theory of software reusabilityESOP '8810.1007/3-540-19027-9_8(115-130)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-19027-9_8
Bernot G(2005)Good functors ... are those preserving philosophy!Category Theory and Computer Science10.1007/3-540-18508-9_26(182-195)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-18508-9_26
Bernot GBidoit MChoppy C(2005)Algebraic semantics of exception handlingESOP 8610.1007/3-540-16442-1_13(173-186)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-16442-1_13
Bernot GBidott MChoppy C(2005)Abstract implementations and correctness proofsSTACS 8610.1007/3-540-16078-7_80(236-251)Online publication date: 5-Jun-2005
https://doi.org/10.1007/3-540-16078-7_80
Kutzler BLichtenberger FKutzler BLichtenberger F(1983)BibliographyBibliography on Abstract Data Types10.1007/978-3-642-69032-7_2(5-87)Online publication date: 1983
https://doi.org/10.1007/978-3-642-69032-7_2
Ehrig HKreowski HMahr BPadawitz P(1982)Algebraic implementation of abstract data typesTheoretical Computer Science10.1016/S0304-3975(82)80001-720:3(209-263)Online publication date: Jul-1982
https://doi.org/10.1016/S0304-3975(82)80001-7
Ehrig HMahr B(1981)Complexity of algebraic implementations for abstract data typesJournal of Computer and System Sciences10.1016/0022-0000(81)90014-323:2(223-253)Online publication date: Oct-1981
https://doi.org/10.1016/0022-0000(81)90014-3
Ehrig HMahr BMiller RBurkhard WLipton RGinsburg S(1980)Complexity of implementations on the level of algebraic specificationsProceedings of the twelfth annual ACM symposium on Theory of computing10.1145/800141.804676(281-293)Online publication date: 28-Apr-1980
https://dl.acm.org/doi/10.1145/800141.804676

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Direct Implementation of Algebraic Specification of Abstract Data Types

AUTOMATIC SYNTHESIS OF IMPLEMENTATION FOR ABSTRACT DATA TYPES FROM ALGEBRAIC SPECIFICATIONS

Polymorphic type inference and abstract data types

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations