Abstract
We present a matching algorithm modulo axioms of categorical products. This infinitary matching returns what we call selector-solved forms in which sets of equations have been simplified as much as possible. Although the selector-solved form is weaker than the fully solved form, it is sufficient for application to program transformation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Backus. Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs. Communication of the Association for Computing Machinery, 21(8), 1978.
F. Bellegarde. Rewriting systems on FP expressions to reduce the number of sequences yielded. Science of Computer Programming, 6, pages 11–34, North Holland, 1986.
S. Bloom and R. Tindell. Varieties of if ... then ... else .... In SIAM Journal on Computing 12(4), pages 677–707, 1983.
H. Comon and P. Lescanne. Equational Problems and Disunification. In Journal of Computer Science, Special issue on Unification. Part one, 7(3–4), pages 371–426, 1989.
P. L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986.
J. Darlington and R. Burstall. A System which automatically improves programs. In Proceedings of the Third International Joint Conference on Artificial Intelligence, Standford, pages 479–484, 1973. Also: Acta Informatica, 6, pages 41–60, 1976.
J. Hannan and D. Miller. Uses of Higher-Order Unification For Implementing Program Transformers. In Proceedings of the Logic Programming Conference MIT Press. Seattle, 1988.
J. Herbrand. Sur la Théorie de la Démonstration,. In Logical Writings, W. Goldbach, ed., Cambridge, 1971.
G. Huet. A Unification algorithm for typed lambda calculus. In Theoretical Computer Science, 1(1):27:57, 1973.
G. Huet and B. Lang. Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Informatica, 11, pages 31–55, Springer-Verlag, 1978.
I. Guessarian and J. Meseguer. On the Axiomatization of “if-then-else”. Internal Report, Center for the Study of Language and Information, CSLI-85-20, Standford, 1985.
J.P. Jouannaud and C. Kirchner. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification, Internal Report, Centre de Recherche en Informatique de Nancy, Nancy, 1989.
R. B. Kieburz and J. Schultis. Transformations of FP program schemes. Proceedings of the Conference on Functional Programming Languages and Computer Architecture. Association for Computing Machinery, 1981.
C. Kirchner and H. Kirchner. Constrained Equational Reasoning. In Proceedings of the ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation, pages 382–389, Portland, 1989.
J. Lambek and P. J. Scott. Introduction to Higher-Order Categorical Logic. Cambridge studies in advanced mathematics, 7, Cambridge University Press, 1986.
A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions On Programming Languages And Systems, 4(2):258–282, 1982.
R. Milner. A proposal for Standard ML. Technical Report CSR-157-83, Computer Science Department, University of Edimburgh, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellegarde, F. (1990). A matching process modulo a theory of categorical products. In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_45
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive