Abstract
In mathematics, algebraic structures are defined according to a rather strict hierarchy: rings come up after groups, which rely themselves on monoids, and so on. In the Foc project, we represent these structures by species. A species is made up of algorithms as well as proofs that these algorithms meet their specifications, and it can be built from existing species through inheritance and refinement mechanisms.
To avoid inconsistencies, these mechanisms must be used carefully. In this paper, we recall the conditions that must be fulfilled when going from a species to another, as formalized by S. Boulmé in his PhD [3]. We then show how these conditions can be checked through a static analysis of the Foc code. Finally, we describe how to translate Foc declarations into Coq.
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
G. Betarte. Dependent Record Types and Formal Abstract Reasoning: Theory and Practice. PhD thesis, University of Göteborg, 1998.
S. Boulmé, T. Hardin, and R. Rioboo. Polymorphic data types, objects, modules and functors: is it too much? Research Report 14, LIP6, 2000. available at http://www.Iip6.fr/reports/lip6.2000.014.html.
S. Boulmé. Spécification d’un environnement dédié á la programmation certifiée de bibliothéques de Calcul Formel. PhD thesis, Université Paris 6, december 2000.
B. Buchberger and all. A survey on the theorema project. In W. Kuechlin, editor, Proceedings of ISSAG’97. ACM Press, 1997.
D. Delahaye. Conception de langages pour décrire les preuves et les automatisations dans les outils d’aide á la preuve. PhD thesis, Université Paris 6, 2001.
G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Research Report 3400, INRIA, 1998.
G. Dowek, T. Hardin, and C. Kirchner. Hol-λσ: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science, 11(l):21–45, 2001.
W. M. Farmer, J. D. Guttman, and F. J. Thayer. The imps user’s manual. Technical Report M-93B138, The mitre Corporation, 202 Burlington Road, Bedford, MA 01730-1420, USA, November 1995. Available at ftp://math.harvard.edu/imps/doc/.
H. Geuvers, R. Pollack, F. Wiedijk, and J. Zwanenburg. The algebraic hierarchy of the fta project. In Proceedings of the Calculemus Workshop, 2001.
R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st Symposium on Principle of Programming Languages, 1994.
P. Jackson. Exploring abstract algebra in constructive type theory. In Proceedings of 12th International Conference on Automated Deduction, July 1994.
R. Pollack. Dependently typed records for representing mathematical structures. In TPHOLs 2000. Springer-Verlag, 2000.
L. Pottier. contrib algebra pour coq, mars 1999. http://pauillac.inria.fr/coq/contribs-eng.html.
V. Prevosto, D. Doligez, and T. Hardin. Overview of the Foc compiler, to appear as a research report, LIP6, 2002. available at http://www-spi.Iip6.fr/~prevosto/papiers/foc2002.ps.gz >.
The Coq Development Team. The Coq Proof Assistant Reference Manual. Projet LogiCal, INRIA-Rocquencourt-LRI Paris 11, Nov. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prevosto, V., Doligez, D., Hardin, T. (2002). Algebraic Structures and Dependent Records. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45685-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-45685-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44039-0
Online ISBN: 978-3-540-45685-8
eBook Packages: Springer Book Archive