Abstract
In this paper we present a FoCaL formalization for quotient structures which are common in mathematics. We first present a framework for stating invariant properties of the data manipulated by running programs. A notion of equivalence relation is then encoded for the FoCaL library. It is implemented through projections functions, this enables us to provide canonical representations which are commonly used in Computer Algebra but seldom formally described. We further provide a FoCaL formalization for the code used inside the library for modular arithmetic through the certification of quotient groups and quotient rings which are involved in the model. We finally instantiate our framework to provide a trusted replacement of the existing FoCaL library.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
