Specification of abstract data types with partially defined operations
Abstract
We investigate equational inference rules for partial algebras and propose conditionally complete equational inference rules for partial algebras. Based on the results obtained from the investigation we propose a new algebraic specification technique for partial abstract data types. It requires no superfluous equations concerning undefinedness.
References
[1]
J.A. Goguen and J.W. Thatcher and E.G. Wagner, "An initial algebra approach to the specification, correctness and implementation of abstract data types", IBM Research Report, RC-6487 (1976)
[2]
J.A. Goguen and J. Meseguer, "Completeness of many sorted equational logic", SIGPLAN NOTICE vol. 16, no. 7, (July 1981)
[3]
J.V. Guttag, E.G. Horowitz and D.R. Musser, "Abstract data types and software validation", CACM, 21, 12 (1978)
[4]
J.V. Guttag and J.J. Horning, "The algebraic specification of abstract data type", Acta Informatica, 10 (1978)
[5]
T. Kasami, K. Taniguchi, Y. Sugiyama, K. Hagihara, I. Suzuki and J. Okui, "On algebraic techniques for program specifications", Technical Report of Group on Automata and Languages, IECE of Japan, AL78-5 (1978) (In Japanese)
[6]
B.H. Liskov and S.N. Zilles, "Specification techniques for data abstraction", IEEE Transaction on SE, SE-1, 1 (1975)
[7]
T. Sakabe, Y. Inagaki and T. Fukumura, "Weak homomorphism between data graphs", Technical Report of Group on Automata and Languages, IECE of Japan, AL74-72 (1976) (In Japanese)
[8]
Y. Sugiyama, K. Taniguchi and T. Kasami, "A specification defined as an extension of a Base algebra", The Transaction of IECE of Japan, J64-D, 4 (April 1981)
[9]
J.W. Thatcher, E.G. Wagner and J.B. Wright, "Data type specification: parameterization and power of specification technique", IBM Research Report RC-7757 (1979)
[10]
J. Monk, "Mathematical logic", Springer-Verlag (1976)
Index Terms
- Specification of abstract data types with partially defined operations
Recommendations
Fields, meadows and abstract data types
Pillars of computer scienceFields and division rings are not algebras in the sense of "Universal Algebra", as inverse is not a total function. Mending the inverse by any definition of 0-1 will not suffice to axiomatize the axiom of inverse x-1 ċ x = 1, by an equation. In ...
Abstract computability and algebraic specification
Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 1982
439 pages
Sponsors
- NBS: National Bureau of Standards
- IPSJ: Information Processing Society of Japan
- SIGSOFT: ACM Special Interest Group on Software Engineering
- IEEE-CS: Computer Society
Publisher
IEEE Computer Society Press
Washington, DC, United States
Publication History
Published: 13 September 1982
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 276 of 1,856 submissions, 15%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 180Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)4
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in