Abstract
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational properties in various particular extensional theories.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barendregt, H.P.: The Lambda Calculus. Studies in Logic and the Foundations of Mathematics, vol. 103. North-Holland, Amsterdam (1991) (revised edition)
Buss, S., Roşu, G.: Incompleteness of behavioral logics. In: Proceeding of CMCS 2000. ENTCS, vol. 33, pp. 61–79. Elsevier, Amsterdam (2000)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. SRI International (January 1999), http://maude.csl.sri.com
Corradini, A.: A complete calculus for equational deduction in coalgebraic specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, Springer, Heidelberg (1998)
Diaconescu, R., Futatsugi, K.: CafeOBJ Report. AMAST Series in Computing, vol. 6. World Scientific, Singapore (1998)
Goguen, J., Lin, K., Roşu, G.: Circular coinductive rewriting. In: Proceedings of Automated Software Engineering 2000, pp. 123–131. IEEE, Los Alamitos (2000)
Goguen, J., Malcolm, G.: A hidden agenda. J. of TCS 245(1), 55–101 (2000)
Goguen, J., Roşu, G.: Hiding more of hidden algebra. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1704–1719. Springer, Heidelberg (1999)
Hennicker, R., Bidoit, M.: Observational logic. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 263–277. Springer, Heidelberg (1998)
Roger Hindley, J., Seldin, J.P.: Introduction to Combinatory Logic and Lambda Calculus. Cambridge University Press, Cambridge (1986)
Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science 62, 222–259 (1997)
Klop, J.W.: Term rewriting systems. In: Handbook of Logic in Computer Science, vol. 1 and 2, Clarendon, Oxford (1992)
Padawitz, P.: Swinging data types: Syntax, semantics, and theory. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 409–435. Springer, Heidelberg (1996)
Reichel, H.: Behavioural equivalence - a unifying concept for initial and final specifications. Proc., 3rd Hungarian CS Conference. Akademiai Kiado, Budapest (1981)
Roşu, G.: Extensional Theories and Rewriting - Extended version. University of Illinois, Technical Rep., http://fsl.cs.uiuc.edu/~grosu/download/icalp04.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roşu, G. (2004). Extensional Theories and Rewriting. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive