This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Goguen, J.W. Thatcher, E.G. Wagner, An Initial Approach to the Specification, Correctness, and Implementation of Abstract Data Types, Current Trends in Programming Methodology, Vol. 4, Ed. Yeh R., Prentice-Hall, pp. 80–149 (1978)
M. Bidoit, The stratified loose approach: a generalization of the initial and loose semantics, in Recent Trends in Data Type Specification, LNCS 332, Springer Verlag (1988)
M. Bidoit, C. Choppy, F. Voisin, The ASSPEGIQUE specification environment, Motivations and design, Proc. of the 3rd Workshop on Theory and Applications of Abstract data types, Bremen, Nov 1984, Recent Trends in Data Type Specification (H.-J. Kreowski ed.), Informatik-Fachberichte 116, Springer Verlag, Berlin-Heidelberg, pp. 54–72 (1985)
C. Choppy, M.-C. Gaudel, Impact des spécifications formelles sur le développement de logiciel, Recuerl des conférences de la Convention Informatique, Tome A, Paris, 19 pp 335–339 (1986)
C. Choppy, Formal specification, prototyping and integration testing, Proc. of the 1st European Software Engineering Conference, Strasbourg, pp. 185–192 (1987)
N. Dershowitz, J.-P. Jouannaud, Rewriting systems, Handbook of Theoretical Computer Science, A. Meyer, M. Nivat, M. Peterson, D. Perrin eds., (to appear 1989)
H. Ehrig, B. Mahr, Fundamentals of algebraic specifications. I: Equations and initial semantics, EATCS monographs on Theoretical Computer Science, Springer Verlag (1985)
K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, J. Meseguer, Principles of OBJ2, Proc. 12th ACM Symp. on Principle of Programming Languages, New Orleans, pp. 52–66 (1985)
M.-C. Gaudel, Towards structured algebraic specifications, Proc. ESPRIT Technical Week, Bruxelles, Springer Verlag (1985)
M.-C. Gaudel, T. Moineau, A theory of software reusability, Proc. of the ESOP'88 Conf., LNCS 300, Springer Verlag (1988)
J.V. Guttag, J.J. Horning, J.W. Wing, The Larch family of specification languages, IEEE Software, 2,4 (1985)
G. Huet, D.C. Oppen, Equations and rewrite rules: a survey, Formal languages: Perspective and open problems, R. Book Ed., Academic Press (1980)
J.-P. Jouannaud, Confluent and coherent sets of reductions with equations, Proc. of the 8th ICALP Conferences, L.N.C.S. 53, pp. 269–283 (1983)
J.-P. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. on Computing 15, pp. 1155–1194 (1986)
S. Kaplan, A compiler for conditional rewriting systems, Proc. 2nd Conf. on Rewriting techniques and applications, Bordeaux, L.N.C.S. 256, Springer Verlag, pp. 25–41 (1987)
J.W. Klop, Term rewriting systems: a tutorial, Bulletin of the EATCS, 32, pp. 143–183 (1987)
M. Wirsing, Algebraic specifications, Handbook of Theoretical Computer Science, A. Meyer, M. Nivat, M. Peterson, D. Perrin eds., (to appear 1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaplan, S., Choppy, C. (1989). Abstract rewriting with concrete operators. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_108
Download citation
DOI: https://doi.org/10.1007/3-540-51081-8_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51081-9
Online ISBN: 978-3-540-46149-4
eBook Packages: Springer Book Archive