Abstract
Fusion theorem is a classical result that allows the simplification of the morphisms among homogeneus structures [10]. We present this theorem and some generalizations in the context of the constructive proof assistant tool Coq [2] where we have dependent types and parametric polymorphism.
The work is organised as follows: afther the classical interpretation of the fusion law for catamorphisms in a categoric context, examples of fusion for programs defined with recursive types in Coq are analysed and the theorems of corresponding optimisation are shown. Finally, a generalisation of fusion law for inductive types is presented which is applied to a specific case.
This work was supported by EC-CICYT Research Project 1FD97-1759 and XUGA PGIDT99COM1052
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arbib, M. A., Manes, E. G.: Algebraic Approaches to Program Semantics. The AKM Series in Theoretical Computer Science. Springer-Verlag. (1986)
Dowek, G., Felty, A., Herbelin, H., Huet, G., Murty, C., Parent, C., Paulin-Mohring, C., Werner, B.: The Coq proof assistant user’s guide. Technical Report 134, INRIA. (1993)
Erwig, M.: Categorical Programming with Abstract Data Types. AMAST’98, LNCS 1548. Springer-Verlag. (1998)
Freire, J. L., Blanco, A. On the Abstraction Process. Brain Processes, Theories and Models. MIT Press. (1996)
Freire, E., Freire, J. L., Blanco, A.: Dialgebras in High Order Programming. Proc. of International Conference on Wiener’s Cybernetics: 50 years of evolution. Las Palmas. (1999)
Gibbons, J.: An Introduction to the Bird-Meertens Formalism. Technical Report, University of Auckland. (1994)
Gordon, M. J., Milner, A. J., Wadsworth, C. P.: Edinburgh LCF: Mechanised Logic of Computation. LNCS 78. Springer-Verlag (1979)
Greiner, J.: Programming with Inductive and Coinductive Types. CMU-CS-92-109. (1992)
Howard, W.: The formulae-as-type notion of construction. In H.B.Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism. Academic Press (1980)
Meijer, E., Fokkinga, M. M., Paterson, R.: Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. FPCA91. LNCS 523. Springer-Verlag. (1991)
Pauling-Mohring, C.: Inductive Definitions in the system Coq-Rules and Properties. LNCS 664. Springer-Verlag. (1993)
Paulin-Mohring, C., Werner, B.: Calcul des Constructions Inductives. DEA Sémantique, Preuves et Programmation. Technical Report, INRIA. (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freire Nistal, J.L., Freire Brañas, J.E., Ferro, A.B., Sánchez Penas, J.J. (2001). Fusion in Coq. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_45
Download citation
DOI: https://doi.org/10.1007/3-540-45654-6_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42959-3
Online ISBN: 978-3-540-45654-4
eBook Packages: Springer Book Archive