Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McMaster University

$18,500.00

New methods for building computer algebra systems

EF 2011-12

Résumé
The main objective of this research is to fundamentally re-examine the methodology currently used to build Computer Algebra Systems, aiming to make substantial improvements. Computer Algebra Systems (CAS) are well-known to be at the forefront of many new programming language technologies (generic programming, dependent types, first-class types, etc), as well adopting advanced software engineering techniques long before they are popular in the mainstream. While the development of new, faster algorithms in the area of Computer Algebra has proceeded at a breakneck pace in the last few years, engineering issues have received less attention. However, recent progress in such areas as type theory, denotational semantics for nominal languages, generative programming and automated testing can all be profitably applied to the construction of CASes. We propose to re-examine, the current state-of-the-art in CAS development, and adapt current techniques in adjoining fields. Just as simple type theory was too weak for Computer Algebra, it is expected that similar leaps will be needed in many areas of programming language theory and software engineering to properly address the very complex needs of a CAS. First, we intend to concentrate on ``generic efficiency'', or how to write algorithms once using generative techniques to produce highly efficient specialized versions. In our MetaOCaml experiments, the correctness guarantees are much higher than in traditional settings, while obtaining very efficient results at a fraction of the effort of developing new optimizing compiler techniques. Secondly, current notions of polymorphism are not sufficient to appropriately express the kinds of ``genericity'' found in mathematics. Approaches that frankly embrace developments in category theory will hopefully bear fruit. This approach has worked very well for the development of powerful specification languages, we hope it can do something similar for programming languages.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
262084-2007
Name nom
Carette, Jacques
Department département
Computing and Software
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2007
Award amount
18500
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2709
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Other computing methods
Research subject fr
Autres méthodes informatiques
Partie
5
Nb partie
5
Application title
New methods for building computer algebra systems
Keyword
NSERC
Application summary
The main objective of this research is to fundamentally re-examine the methodology currently used to build Computer Algebra Systems, aiming to make substantial improvements. Computer Algebra Systems (CAS) are well-known to be at the forefront of many new programming language technologies (generic programming, dependent types, first-class types, etc), as well adopting advanced software engineering techniques long before they are popular in the mainstream. While the development of new, faster algorithms in the area of Computer Algebra has proceeded at a breakneck pace in the last few years, engineering issues have received less attention. However, recent progress in such areas as type theory, denotational semantics for nominal languages, generative programming and automated testing can all be profitably applied to the construction of CASes. We propose to re-examine, the current state-of-the-art in CAS development, and adapt current techniques in adjoining fields. Just as simple type theory was too weak for Computer Algebra, it is expected that similar leaps will be needed in many areas of programming language theory and software engineering to properly address the very complex needs of a CAS. First, we intend to concentrate on ``generic efficiency'', or how to write algorithms once using generative techniques to produce highly efficient specialized versions. In our MetaOCaml experiments, the correctness guarantees are much higher than in traditional settings, while obtaining very efficient results at a fraction of the effort of developing new optimizing compiler techniques. Secondly, current notions of polymorphism are not sufficient to appropriately express the kinds of ``genericity'' found in mathematics. Approaches that frankly embrace developments in category theory will hopefully bear fruit. This approach has worked very well for the development of powerful specification languages, we hope it can do something similar for programming languages.