Abstract
This paper is intended to outline, in the context of predicate logic, a constructive methodology for algebraic specifications. The major advantage of this presentation is that the abstract semantics and the operational one are both based on the same formalism, namely the first order logic. A practical implementation is given in the programming language PROLOG. Algebraic abstract data types are interpreted as term rewriting systems with a set of operations on types in order to extend the initial collection of types. Using this schema, we consider a computer algebra system as a universe of types described by the user as the context of his calculations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. AUSIELLO, G.F. MASCARI, "On the Design of Algebraic Data Structures with the Approach of Abstract Data Types", LNCS No72, 1979.
M. BERGMAN, P. DERANSART, "Abstract Data Types and rewriting systems: Application to the programming of Algebraic Abstract Data Types in PROLOG", CAAP'81, Trees in Algebra and Programming, 6th Colloquium, Gènes, Mars 1981, LNCS No112, 1981.
R.M. BURSTALL, J.A. GOGUEN, "Putting Theories together to make Specifications", Proc. of 5th. International Joint Conference, MASS. 1977, pp. 1045–1052.
R.M. BURSTALL, J.A. GOGUEN, "The Semantics of CLEAR, a Specification Language", Proc. of 1979 Copenhagen Winter School on Abstract Software Specifications, 1980.
A. COLMERAUER, H. KANOUI, M. VAN CANEGHEM, "PROLOG II", Rapport de Recherche, Groupe Intelligence Artificielle, Univ. d'Aix-Marseille, 1981.
J.V. GUTTAG, E. HOROWITZ, D.R. MUSSER, "Abstract Data Types and Software Validation", C. ACM, Vol. 21, No 12, December 78.
G. HUET, D.C. OPPEN, "Equations and Rewrite Rules: a Survey", Technical Report CSL-111, SRI 1980.
R. JENKS, "MODLISP: An Introduction", Proc. of EUROSAM'79 Conference, Marseille June 1979, Ed. by Ed. Ng, LNCS No 72, 1979.
R. JENKS, B.M. TRAGER, "A Language for Computational Algebra", Proc. of the ACM Symposium on Symbolic and Algebraic Computation, SYMSAC'81, Edited by P.S. Wang., ACM, 1981.
R.A. KOWALSKI, "Predicate Logic as Programming Language", Proc. IFIP 74, North Holland Pub. Co., 1974.
R.A. KOWALSKI, "Logic for Problem Solving", Elsevier North Holland, New York, 1979.
R. LOOS, "Toward a Formal Implementation of Computer Algebra", Proc. of EUROSAM'74, Stockholm, Aug. 1974, SIGSAM Bull., Vol. 8, No 3, Aug. 1974.
P. MARTIN-LOF, "An Intuitionistic Theory of Types: Predicative Part", Poc. of Logic Colloquium'73, Edited by H.E. Rose and J.C. Shepherdson, North-Holland, Amsterdam, 1975, pp. 73–118.
P. MARTIN-LOF, "Constructive Mathematics and Computer Programming", Paper read at the 6th International Congress for Logic, Methodology and Philosophy of Science, Hannover, 22–29 August 1979.
D.R. MUSSER, "Abstract data type specification in the AFFIRM system", IEEE Tr. on Software Engenering SE-6, 1–1980.
Ph. ROUSSEL, "PROLOG, Manuel de référence et d'utilisation", ATP Informatique-CNRS, Rapport final, 1974.
J. SHOENFIELD, "MATHEMATICAL LOGIC", Addison-Wesley Publishing Co, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergman, M. (1982). Algebraic specifications: A constructive methodology in logic programming. In: Calmet, J. (eds) Computer Algebra. EUROCAM 1982. Lecture Notes in Computer Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11607-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-11607-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11607-3
Online ISBN: 978-3-540-39433-4
eBook Packages: Springer Book Archive