This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Benecke, K. and Reichel, H. Equational Partiality. In Algebra Universalis, 1984.
Cunningham, R. J. and Dick, A. J. J. Rewrite Systems on a Lattice of Types. Imperial College, Department of Computing, 1983.
Futatsugi, K., Goguen, J., Jouannaud, J.-P., and Meseguer, J. Principles of OBJ2. In Proceedings, 1985 Symposium on Principles of Programming Languages, ACM, 1985, pp. 52–66.
Gabriel, P. and Ulmer, F. Lokal Präsentierbare Kategorien. Springer-Verlag, 1971. Springer Lecture Notes in Mathematics, vol. 221.
Gogolla, M. Algebraic Specifications with Partially Ordered Sorts and Declarations. 169, Universitat Dortmund, Abteilung Informatik, 1983.
Goguen, J. A. Order Sorted Algebra. UCLA Computer Science Department, 1978. Semantics and Theory of Computation Report No. 14.
Goguen, J. A. and Meseguer, J. “Completeness of Many-sorted Equational Logic.“ SIGPLAN Notices 16, 7 (July 1981), 24–32. Also appeared in SIGPLAN Notices, January 1982, vol. 17, no. 1, pages 9–17; extended version as SRI Technical Report CSL-135, May 1982; final version as Technical Report CSLI-84-15, Center for the Study of Language and Information, Stanford University, September 1984, and to be published in Houston Journal of Mathematics.
Goguen, J. A. and Meseguer, J. Universal Realization, Persistent Interconnection and Implementation of Abstract Modules. In Proceedings, 9th ICALP, Springer-Verlag, 1982.
Goguen, J. and Meseguer, J. Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance. To appear, SRI International, Computer Science Lab, 1985.Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983.
Goguen, J. A., Thatcher, J. W. and Wagner, E. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. RC 6487, IBM T. J. Watson Research Center, October, 1976.Reprinted in Current Trends in Programming Methodology, IV, ed. R. Yeh, Prentice-Hall, 1978, pp. 80–149.
Jouannaud, J.P. and Kirchner, H. Completion of a Set of Rules Modulo a Set of Equations. In Proceedings, 11th Symposium on Principles of Programming Languages, ACM, 1984, pp. 83–92.
Lescanne, P. Computer Experiments with the REVE Term Rewriting Systems Generator. In Proceedings, Symposium on Principles of Programming Languages, ACM, 1983.
Messeguer, J. and Goguen, J. A. Initiality, Induction and Computability. In Algebraic Methods in Semantics, M. Nivat and J. Reynolds, Eds., Cambridge University Press, 1985, pp. 459–540.
Meseguer, J. and Goguen, J. Deduction with Many-Sorted Rewrite Rules. Technical Report, SRI International, Computer Science Lab.
Walther, C. A Many-sorted Calculus Based on Resolution and Paramodulation. In Eighth International Joint Conference on Artificial Intelligence, W. Kaufman (Los Altos CA), 1983, pp. 882–891.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goguen, J.A., Jouannaud, JP., Meseguer, J. (1985). Operational semantics for order-sorted algebra. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015747
Download citation
DOI: https://doi.org/10.1007/BFb0015747
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive