Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

McMaster University

$22,000.00

Disciplined Meta-Programming

FY 2013-14

Summary
Computer scientists have been writing programs which manipulate programs (such as compilers) for a very long time. Software engineers, on the other hand, have been much slower to use this particular technique, mostly because standard design methodologies do not embrace such techniques. This has recently started to change, and there are a variety of reasons for this, amongst which: 1. the increasing popularity of Domain Specific Languages, 2. the fact that writing parallel software by hand is difficult and error-prone, and 3. that current programming languages offer poor ""higher-level"" abstraction mechanisms. Unfortunately, few meta-programs (as programs which manipulate programs are called) encountered ""in the wild"" are as well-structured as ""regular"" programs. In other words, there does not seem to be good development models for writing such programs. This is rather unfortunate, as meta-programs allow standard software engineering concepts (such as design choices) to become first-class software artifacts. Furthermore, in the case of mature domains (like scientific computation), higher-order structure can be effectively captured and leveraged to both drastically shorten source programs as well as to generate more efficient run-time programs. Our objective is to rectify this situation, in the context of statically-typed, purely functional meta-programming. We will continue our successful work on finding and inventing the techniques necessary for writing disciplined and modular meta-programs. One very successful approach has been to take program families, and engineer non ad hoc abstractions which appropriately capture the design choices of those families. These abstractions form the core of generators for the family members. Through writing larger generative libraries of reusable components (for scientific computation and for games), we will leverage our ongoing foundational work on mechanized mathematics (the MathScheme project), as well as our expertise in advanced meta-programming techniques, to distill our experience-driven design knowledge into an effective development methodology which can appropriately encompass the design of principled meta-programs.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
262084-2012
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
2013
Competition year année de concours
2012
Award amount
22000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2706
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Software engineering
Research subject fr
Génie logiciel
Partie
2
Nb partie
5
Application title
Disciplined Meta-Programming
Keyword
NSERC
Application summary
Computer scientists have been writing programs which manipulate programs (such as compilers) for a very long time. Software engineers, on the other hand, have been much slower to use this particular technique, mostly because standard design methodologies do not embrace such techniques. This has recently started to change, and there are a variety of reasons for this, amongst which: 1. the increasing popularity of Domain Specific Languages, 2. the fact that writing parallel software by hand is difficult and error-prone, and 3. that current programming languages offer poor ""higher-level"" abstraction mechanisms. Unfortunately, few meta-programs (as programs which manipulate programs are called) encountered ""in the wild"" are as well-structured as ""regular"" programs. In other words, there does not seem to be good development models for writing such programs. This is rather unfortunate, as meta-programs allow standard software engineering concepts (such as design choices) to become first-class software artifacts. Furthermore, in the case of mature domains (like scientific computation), higher-order structure can be effectively captured and leveraged to both drastically shorten source programs as well as to generate more efficient run-time programs. Our objective is to rectify this situation, in the context of statically-typed, purely functional meta-programming. We will continue our successful work on finding and inventing the techniques necessary for writing disciplined and modular meta-programs. One very successful approach has been to take program families, and engineer non ad hoc abstractions which appropriately capture the design choices of those families. These abstractions form the core of generators for the family members. Through writing larger generative libraries of reusable components (for scientific computation and for games), we will leverage our ongoing foundational work on mechanized mathematics (the MathScheme project), as well as our expertise in advanced meta-programming techniques, to distill our experience-driven design knowledge into an effective development methodology which can appropriately encompass the design of principled meta-programs.